./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 561472dda653ab23fa8eff641224e01683fc61ba ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 16:59:24,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 16:59:24,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 16:59:24,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 16:59:24,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 16:59:24,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 16:59:24,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 16:59:24,950 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 16:59:24,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 16:59:24,953 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 16:59:24,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 16:59:24,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 16:59:24,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 16:59:24,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 16:59:24,958 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 16:59:24,958 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 16:59:24,959 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 16:59:24,961 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 16:59:24,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 16:59:24,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 16:59:24,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 16:59:24,970 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 16:59:24,976 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 16:59:24,978 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 16:59:24,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 16:59:24,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 16:59:24,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 16:59:24,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 16:59:24,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 16:59:24,986 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 16:59:24,986 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 16:59:24,987 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 16:59:24,987 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 16:59:24,987 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 16:59:24,988 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 16:59:24,989 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 16:59:24,989 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 16:59:25,014 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 16:59:25,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 16:59:25,016 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 16:59:25,017 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 16:59:25,018 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 16:59:25,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 16:59:25,018 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 16:59:25,019 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 16:59:25,019 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 16:59:25,020 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 16:59:25,020 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 16:59:25,020 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 16:59:25,020 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 16:59:25,020 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 16:59:25,020 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 16:59:25,021 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 16:59:25,022 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 16:59:25,022 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 16:59:25,022 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 16:59:25,022 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 16:59:25,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 16:59:25,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 16:59:25,025 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 16:59:25,025 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 16:59:25,025 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 16:59:25,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 16:59:25,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 16:59:25,025 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 561472dda653ab23fa8eff641224e01683fc61ba [2019-01-14 16:59:25,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 16:59:25,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 16:59:25,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 16:59:25,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 16:59:25,107 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 16:59:25,109 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i [2019-01-14 16:59:25,170 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707c985be/7af57d9dee1f46419a0d70637f3293b0/FLAG50bc3182a [2019-01-14 16:59:25,613 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 16:59:25,614 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/invert_string_false-unreach-call_true-termination.i [2019-01-14 16:59:25,619 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707c985be/7af57d9dee1f46419a0d70637f3293b0/FLAG50bc3182a [2019-01-14 16:59:26,005 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/707c985be/7af57d9dee1f46419a0d70637f3293b0 [2019-01-14 16:59:26,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 16:59:26,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 16:59:26,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 16:59:26,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 16:59:26,015 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 16:59:26,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:26" (1/1) ... [2019-01-14 16:59:26,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d04184c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26, skipping insertion in model container [2019-01-14 16:59:26,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:59:26" (1/1) ... [2019-01-14 16:59:26,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 16:59:26,047 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 16:59:26,274 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 16:59:26,283 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 16:59:26,312 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 16:59:26,334 INFO L195 MainTranslator]: Completed translation [2019-01-14 16:59:26,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26 WrapperNode [2019-01-14 16:59:26,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 16:59:26,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 16:59:26,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 16:59:26,337 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 16:59:26,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26" (1/1) ... [2019-01-14 16:59:26,356 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26" (1/1) ... [2019-01-14 16:59:26,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 16:59:26,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 16:59:26,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 16:59:26,388 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 16:59:26,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26" (1/1) ... [2019-01-14 16:59:26,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26" (1/1) ... [2019-01-14 16:59:26,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26" (1/1) ... [2019-01-14 16:59:26,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26" (1/1) ... [2019-01-14 16:59:26,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26" (1/1) ... [2019-01-14 16:59:26,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26" (1/1) ... [2019-01-14 16:59:26,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26" (1/1) ... [2019-01-14 16:59:26,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 16:59:26,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 16:59:26,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 16:59:26,481 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 16:59:26,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 16:59:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 16:59:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 16:59:26,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 16:59:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 16:59:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 16:59:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 16:59:26,896 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 16:59:26,897 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-14 16:59:26,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:26 BoogieIcfgContainer [2019-01-14 16:59:26,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 16:59:26,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 16:59:26,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 16:59:26,902 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 16:59:26,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 04:59:26" (1/3) ... [2019-01-14 16:59:26,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac10b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 04:59:26, skipping insertion in model container [2019-01-14 16:59:26,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:59:26" (2/3) ... [2019-01-14 16:59:26,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac10b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 04:59:26, skipping insertion in model container [2019-01-14 16:59:26,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:26" (3/3) ... [2019-01-14 16:59:26,905 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2019-01-14 16:59:26,913 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 16:59:26,920 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 16:59:26,937 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 16:59:26,968 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 16:59:26,969 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 16:59:26,969 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 16:59:26,969 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 16:59:26,970 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 16:59:26,970 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 16:59:26,970 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 16:59:26,970 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 16:59:26,970 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 16:59:26,986 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-01-14 16:59:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 16:59:26,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:26,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:26,995 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:27,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2016449835, now seen corresponding path program 1 times [2019-01-14 16:59:27,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:27,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:27,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:27,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:27,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:27,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:59:27,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 16:59:27,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 16:59:27,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 16:59:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 16:59:27,198 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2019-01-14 16:59:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:27,331 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-01-14 16:59:27,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 16:59:27,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-14 16:59:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:27,341 INFO L225 Difference]: With dead ends: 33 [2019-01-14 16:59:27,342 INFO L226 Difference]: Without dead ends: 15 [2019-01-14 16:59:27,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 16:59:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-14 16:59:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-14 16:59:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 16:59:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-14 16:59:27,375 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2019-01-14 16:59:27,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:27,375 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 16:59:27,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 16:59:27,376 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-01-14 16:59:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 16:59:27,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:27,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:27,377 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:27,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:27,377 INFO L82 PathProgramCache]: Analyzing trace with hash 867342291, now seen corresponding path program 1 times [2019-01-14 16:59:27,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:27,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:27,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:27,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:27,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 16:59:27,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 16:59:27,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 16:59:27,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 16:59:27,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 16:59:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 16:59:27,472 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 3 states. [2019-01-14 16:59:27,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:27,552 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2019-01-14 16:59:27,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 16:59:27,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 16:59:27,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:27,558 INFO L225 Difference]: With dead ends: 28 [2019-01-14 16:59:27,558 INFO L226 Difference]: Without dead ends: 17 [2019-01-14 16:59:27,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 16:59:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-14 16:59:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-14 16:59:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 16:59:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-01-14 16:59:27,565 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2019-01-14 16:59:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:27,565 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-01-14 16:59:27,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 16:59:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-01-14 16:59:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 16:59:27,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:27,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:27,567 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:27,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2031054225, now seen corresponding path program 1 times [2019-01-14 16:59:27,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:27,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:27,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:27,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:27,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:28,016 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 16:59:28,503 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 22 [2019-01-14 16:59:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:28,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:28,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:59:28,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:28,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:28,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 16:59:28,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:28,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:28,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-01-14 16:59:28,831 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 16:59:29,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-01-14 16:59:29,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 16:59:29,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:29,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:29,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:29,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-01-14 16:59:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:29,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:29,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-01-14 16:59:29,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 16:59:29,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 16:59:29,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-01-14 16:59:29,330 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 16 states. [2019-01-14 16:59:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:30,351 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-01-14 16:59:30,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 16:59:30,354 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2019-01-14 16:59:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:30,357 INFO L225 Difference]: With dead ends: 38 [2019-01-14 16:59:30,358 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 16:59:30,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2019-01-14 16:59:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 16:59:30,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2019-01-14 16:59:30,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 16:59:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-01-14 16:59:30,367 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2019-01-14 16:59:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:30,367 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-01-14 16:59:30,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 16:59:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-01-14 16:59:30,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 16:59:30,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:30,369 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:30,369 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:30,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:30,370 INFO L82 PathProgramCache]: Analyzing trace with hash -628241457, now seen corresponding path program 2 times [2019-01-14 16:59:30,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:30,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:30,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:30,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:30,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:30,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:30,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:30,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:59:30,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 16:59:30,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 16:59:30,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:59:30,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:30,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:30,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-01-14 16:59:30,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 16:59:30,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 16:59:30,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 16:59:30,648 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 6 states. [2019-01-14 16:59:30,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:30,882 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-01-14 16:59:30,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 16:59:30,883 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-14 16:59:30,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:30,884 INFO L225 Difference]: With dead ends: 43 [2019-01-14 16:59:30,885 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 16:59:30,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 16:59:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 16:59:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-01-14 16:59:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 16:59:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-01-14 16:59:30,893 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2019-01-14 16:59:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:30,893 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-14 16:59:30,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 16:59:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-01-14 16:59:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 16:59:30,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:30,895 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:30,895 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:30,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:30,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1786824679, now seen corresponding path program 1 times [2019-01-14 16:59:30,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:30,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:30,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:30,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:59:30,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 16:59:31,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:31,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:59:31,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:31,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 16:59:31,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:31,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-01-14 16:59:31,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 16:59:31,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 16:59:31,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-14 16:59:31,184 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 10 states. [2019-01-14 16:59:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:31,350 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-01-14 16:59:31,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 16:59:31,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-01-14 16:59:31,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:31,352 INFO L225 Difference]: With dead ends: 49 [2019-01-14 16:59:31,352 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 16:59:31,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-14 16:59:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 16:59:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2019-01-14 16:59:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 16:59:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-01-14 16:59:31,362 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2019-01-14 16:59:31,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:31,363 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-01-14 16:59:31,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 16:59:31,363 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-01-14 16:59:31,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 16:59:31,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:31,364 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:31,364 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:31,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:31,365 INFO L82 PathProgramCache]: Analyzing trace with hash -799235507, now seen corresponding path program 3 times [2019-01-14 16:59:31,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:31,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:31,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:31,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 16:59:31,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:31,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:31,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:59:31,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 16:59:31,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 16:59:31,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:59:31,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:32,065 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 16:59:32,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 16:59:32,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:32,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:32,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2019-01-14 16:59:32,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-01-14 16:59:32,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2019-01-14 16:59:32,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:32,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:32,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:32,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-14 16:59:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:32,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:32,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-01-14 16:59:32,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 16:59:32,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 16:59:32,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2019-01-14 16:59:32,392 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 22 states. [2019-01-14 16:59:33,676 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-01-14 16:59:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:33,854 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-01-14 16:59:33,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 16:59:33,855 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2019-01-14 16:59:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:33,857 INFO L225 Difference]: With dead ends: 50 [2019-01-14 16:59:33,857 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 16:59:33,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2019-01-14 16:59:33,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 16:59:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2019-01-14 16:59:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 16:59:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-01-14 16:59:33,867 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2019-01-14 16:59:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:33,867 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-01-14 16:59:33,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 16:59:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-01-14 16:59:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 16:59:33,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:33,868 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:33,869 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1927655819, now seen corresponding path program 4 times [2019-01-14 16:59:33,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:33,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:33,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:33,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:59:33,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 16:59:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 16:59:33,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 16:59:33,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 16:59:33,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 16:59:33,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 16:59:33,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 16:59:33,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 16:59:34,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2019-01-14 16:59:34,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-01-14 16:59:34,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:34,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:34,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:34,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-01-14 16:59:34,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2019-01-14 16:59:34,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 16:59:34,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2019-01-14 16:59:34,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 16:59:34,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:34,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 16:59:34,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2019-01-14 16:59:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 16:59:34,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 16:59:34,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-01-14 16:59:34,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 16:59:34,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 16:59:34,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-01-14 16:59:34,604 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 15 states. [2019-01-14 16:59:35,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 16:59:35,700 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-01-14 16:59:35,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 16:59:35,701 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-01-14 16:59:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 16:59:35,702 INFO L225 Difference]: With dead ends: 77 [2019-01-14 16:59:35,702 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 16:59:35,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2019-01-14 16:59:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 16:59:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 42. [2019-01-14 16:59:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 16:59:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2019-01-14 16:59:35,714 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2019-01-14 16:59:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 16:59:35,714 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2019-01-14 16:59:35,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 16:59:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2019-01-14 16:59:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 16:59:35,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 16:59:35,715 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 16:59:35,716 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 16:59:35,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 16:59:35,716 INFO L82 PathProgramCache]: Analyzing trace with hash 980237987, now seen corresponding path program 2 times [2019-01-14 16:59:35,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 16:59:35,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 16:59:35,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:35,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 16:59:35,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 16:59:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 16:59:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 16:59:35,790 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 16:59:35,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 04:59:35 BoogieIcfgContainer [2019-01-14 16:59:35,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 16:59:35,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 16:59:35,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 16:59:35,824 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 16:59:35,825 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:59:26" (3/4) ... [2019-01-14 16:59:35,827 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 16:59:35,888 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 16:59:35,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 16:59:35,889 INFO L168 Benchmark]: Toolchain (without parser) took 9880.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.9 MB). Free memory was 943.3 MB in the beginning and 1.3 GB in the end (delta: -321.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 16:59:35,890 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 16:59:35,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.80 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 16:59:35,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.09 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 16:59:35,891 INFO L168 Benchmark]: Boogie Preprocessor took 93.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-01-14 16:59:35,892 INFO L168 Benchmark]: RCFGBuilder took 417.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-01-14 16:59:35,893 INFO L168 Benchmark]: TraceAbstraction took 8924.76 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -173.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 16:59:35,893 INFO L168 Benchmark]: Witness Printer took 64.14 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 16:59:35,897 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.80 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.09 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 417.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8924.76 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -173.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 64.14 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int MAX = __VERIFIER_nondet_uint(); [L16] char str1[MAX], str2[MAX]; [L17] int cont, i, j; [L18] cont = 0 [L20] i=0 [L20] COND TRUE i= 0 [L28] EXPR str1[0] [L28] str2[j] = str1[0] [L29] j++ [L27] i-- [L27] COND TRUE i >= 0 [L28] EXPR str1[0] [L28] str2[j] = str1[0] [L29] j++ [L27] i-- [L27] COND FALSE !(i >= 0) [L32] j = MAX-1 [L33] i=0 [L33] COND TRUE i