java -Xmx8000000000 -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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/KojakBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default_PUPT.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 13:57:48,600 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 13:57:48,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 13:57:48,615 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 13:57:48,615 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 13:57:48,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 13:57:48,617 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 13:57:48,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 13:57:48,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 13:57:48,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 13:57:48,623 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 13:57:48,623 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 13:57:48,624 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 13:57:48,625 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 13:57:48,628 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 13:57:48,629 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 13:57:48,630 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 13:57:48,632 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 13:57:48,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 13:57:48,636 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 13:57:48,637 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 13:57:48,638 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 13:57:48,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 13:57:48,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 13:57:48,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 13:57:48,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 13:57:48,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 13:57:48,644 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 13:57:48,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 13:57:48,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 13:57:48,646 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 13:57:48,647 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 13:57:48,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 13:57:48,647 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 13:57:48,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 13:57:48,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 13:57:48,649 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Kojak_Default_PUPT.epf [2018-10-04 13:57:48,672 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 13:57:48,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 13:57:48,673 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 13:57:48,674 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 13:57:48,674 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 13:57:48,675 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 13:57:48,675 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 13:57:48,675 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 13:57:48,675 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 13:57:48,675 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 13:57:48,676 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 13:57:48,676 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 13:57:48,676 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 13:57:48,676 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 13:57:48,676 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 13:57:48,677 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 13:57:48,677 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 13:57:48,677 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-04 13:57:48,677 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-04 13:57:48,677 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 13:57:48,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 13:57:48,678 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 13:57:48,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-04 13:57:48,678 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 13:57:48,678 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 13:57:48,679 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 13:57:48,679 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-04 13:57:48,679 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 13:57:48,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 13:57:48,679 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 13:57:48,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 13:57:48,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 13:57:48,750 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 13:57:48,752 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 13:57:48,753 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 13:57:48,753 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl [2018-10-04 13:57:48,754 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl' [2018-10-04 13:57:48,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 13:57:48,802 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 13:57:48,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 13:57:48,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 13:57:48,803 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 13:57:48,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:57:48" (1/1) ... [2018-10-04 13:57:48,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:57:48" (1/1) ... [2018-10-04 13:57:48,843 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 13:57:48,843 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 13:57:48,844 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 13:57:48,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 13:57:48,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 13:57:48,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 13:57:48,847 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 13:57:48,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:57:48" (1/1) ... [2018-10-04 13:57:48,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:57:48" (1/1) ... [2018-10-04 13:57:48,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:57:48" (1/1) ... [2018-10-04 13:57:48,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:57:48" (1/1) ... [2018-10-04 13:57:48,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:57:48" (1/1) ... [2018-10-04 13:57:48,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:57:48" (1/1) ... [2018-10-04 13:57:48,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:57:48" (1/1) ... [2018-10-04 13:57:48,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 13:57:48,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 13:57:48,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 13:57:48,877 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 13:57:48,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 01:57:48" (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:10000 (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:10000 [2018-10-04 13:57:48,957 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2018-10-04 13:57:48,957 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2018-10-04 13:57:49,247 INFO L338 CfgBuilder]: Using library mode [2018-10-04 13:57:49,247 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 01:57:49 BoogieIcfgContainer [2018-10-04 13:57:49,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 13:57:49,248 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-04 13:57:49,248 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-04 13:57:49,260 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-04 13:57:49,260 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 01:57:49" (1/1) ... [2018-10-04 13:57:49,276 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 13:57:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 8 states and 9 transitions. [2018-10-04 13:57:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-04 13:57:49,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 13:57:49,313 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:49,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 9 states and 12 transitions. [2018-10-04 13:57:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-10-04 13:57:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 13:57:49,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 13 states and 18 transitions. [2018-10-04 13:57:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2018-10-04 13:57:50,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 13:57:50,399 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:50,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 15 states and 24 transitions. [2018-10-04 13:57:51,240 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2018-10-04 13:57:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 13:57:51,240 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 16 states and 27 transitions. [2018-10-04 13:57:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 27 transitions. [2018-10-04 13:57:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 13:57:51,988 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 19 states and 34 transitions. [2018-10-04 13:57:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 34 transitions. [2018-10-04 13:57:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 13:57:52,465 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:53,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:53,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-10-04 13:57:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-10-04 13:57:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 13:57:53,344 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 20 states and 30 transitions. [2018-10-04 13:57:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2018-10-04 13:57:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 13:57:53,858 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:55,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 22 states and 33 transitions. [2018-10-04 13:57:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2018-10-04 13:57:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 13:57:55,091 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:55,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 23 states and 35 transitions. [2018-10-04 13:57:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2018-10-04 13:57:55,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 13:57:55,768 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 25 states and 38 transitions. [2018-10-04 13:57:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. [2018-10-04 13:57:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 13:57:56,347 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 27 states and 41 transitions. [2018-10-04 13:57:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2018-10-04 13:57:56,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 13:57:56,773 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:57,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 28 states and 43 transitions. [2018-10-04 13:57:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 43 transitions. [2018-10-04 13:57:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 13:57:57,225 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 29 states and 44 transitions. [2018-10-04 13:57:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2018-10-04 13:57:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 13:57:57,848 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 31 states and 47 transitions. [2018-10-04 13:57:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2018-10-04 13:57:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 13:57:58,749 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 33 states and 50 transitions. [2018-10-04 13:57:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2018-10-04 13:57:59,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 13:57:59,199 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:57:59,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:57:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 34 states and 52 transitions. [2018-10-04 13:57:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 52 transitions. [2018-10-04 13:57:59,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 13:57:59,718 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:57:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:57:59,925 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 19 [2018-10-04 13:57:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 36 states and 55 transitions. [2018-10-04 13:58:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2018-10-04 13:58:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 13:58:00,448 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 38 states and 58 transitions. [2018-10-04 13:58:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2018-10-04 13:58:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 13:58:01,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 39 states and 60 transitions. [2018-10-04 13:58:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2018-10-04 13:58:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 13:58:01,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 40 states and 62 transitions. [2018-10-04 13:58:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 62 transitions. [2018-10-04 13:58:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 13:58:02,559 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:03,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 42 states and 65 transitions. [2018-10-04 13:58:03,216 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2018-10-04 13:58:03,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 13:58:03,217 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 44 states and 68 transitions. [2018-10-04 13:58:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2018-10-04 13:58:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 13:58:03,907 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 45 states and 70 transitions. [2018-10-04 13:58:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 70 transitions. [2018-10-04 13:58:04,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 13:58:04,521 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 46 states and 71 transitions. [2018-10-04 13:58:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 71 transitions. [2018-10-04 13:58:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 13:58:05,396 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 48 states and 74 transitions. [2018-10-04 13:58:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 74 transitions. [2018-10-04 13:58:06,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 13:58:06,289 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 50 states and 77 transitions. [2018-10-04 13:58:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2018-10-04 13:58:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 13:58:06,980 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 51 states and 79 transitions. [2018-10-04 13:58:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 79 transitions. [2018-10-04 13:58:08,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 13:58:08,445 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 66 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:09,789 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 39 new depth: 32 [2018-10-04 13:58:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 52 states and 81 transitions. [2018-10-04 13:58:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2018-10-04 13:58:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 13:58:11,213 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 54 states and 84 transitions. [2018-10-04 13:58:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 84 transitions. [2018-10-04 13:58:12,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 13:58:12,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 56 states and 87 transitions. [2018-10-04 13:58:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2018-10-04 13:58:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 13:58:14,471 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:15,052 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:15,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 57 states and 89 transitions. [2018-10-04 13:58:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 89 transitions. [2018-10-04 13:58:15,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 13:58:15,811 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 58 states and 91 transitions. [2018-10-04 13:58:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 91 transitions. [2018-10-04 13:58:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 13:58:17,703 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 60 states and 94 transitions. [2018-10-04 13:58:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 94 transitions. [2018-10-04 13:58:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 13:58:18,746 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 62 states and 97 transitions. [2018-10-04 13:58:19,480 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. [2018-10-04 13:58:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 13:58:19,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 63 states and 99 transitions. [2018-10-04 13:58:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2018-10-04 13:58:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 13:58:20,477 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 64 states and 100 transitions. [2018-10-04 13:58:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2018-10-04 13:58:22,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 13:58:22,360 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 105 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 65 states and 102 transitions. [2018-10-04 13:58:23,921 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 102 transitions. [2018-10-04 13:58:23,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 13:58:23,922 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 67 states and 105 transitions. [2018-10-04 13:58:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 105 transitions. [2018-10-04 13:58:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 13:58:25,202 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 13:58:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 69 states and 108 transitions. [2018-10-04 13:58:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 108 transitions. [2018-10-04 13:58:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 13:58:26,058 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 13:58:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 13:58:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 13:58:27,341 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (not (and (= Main_x 0) (not (= Main_y 0)))))) (and .cse0 (not .cse0))) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:412) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:405) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.restructurePredicateTrie(BPredicateUnifier.java:371) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:249) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:218) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeChecker.negatePredicate(CodeChecker.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.kojak.UltimateChecker.isSatEdge(UltimateChecker.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.kojak.UltimateChecker.connectOutgoingIfSat(UltimateChecker.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.kojak.UltimateChecker.splitNode(UltimateChecker.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.kojak.UltimateChecker.codeCheck(UltimateChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:492) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-04 13:58:27,345 INFO L168 Benchmark]: Toolchain (without parser) took 38544.25 ms. Allocated memory was 1.6 GB in the beginning and 2.0 GB in the end (delta: 404.8 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 418.4 MB). Peak memory consumption was 823.2 MB. Max. memory is 7.1 GB. [2018-10-04 13:58:27,348 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 13:58:27,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.31 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 13:58:27,349 INFO L168 Benchmark]: Boogie Preprocessor took 28.72 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 13:58:27,349 INFO L168 Benchmark]: RCFGBuilder took 371.13 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 13:58:27,350 INFO L168 Benchmark]: CodeCheck took 38095.88 ms. Allocated memory was 1.6 GB in the beginning and 2.0 GB in the end (delta: 404.8 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 397.3 MB). Peak memory consumption was 802.0 MB. Max. memory is 7.1 GB. [2018-10-04 13:58:27,355 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (not (and (= Main_x 0) (not (= Main_y 0)))))) (and .cse0 (not .cse0))) de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: UnsupportedOperationException: Solver cannot find a model for the term (let ((.cse0 (not (and (= Main_x 0) (not (= Main_y 0)))))) (and .cse0 (not .cse0))): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.PredicateTrie.getWitness(PredicateTrie.java:213) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.31 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.72 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 371.13 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 38095.88 ms. Allocated memory was 1.6 GB in the beginning and 2.0 GB in the end (delta: 404.8 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 397.3 MB). Peak memory consumption was 802.0 MB. Max. memory is 7.1 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/doubleLoopUniformIterations.bpl_svcomp-Reach-32bit-Kojak_Default_PUPT.epf_KojakBplInline.xml/Csv-Benchmark-0-2018-10-04_13-58-27-366.csv Received shutdown request...