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-133090d [2018-10-04 10:52:17,833 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 10:52:17,835 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 10:52:17,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 10:52:17,854 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 10:52:17,857 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 10:52:17,859 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 10:52:17,861 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 10:52:17,864 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 10:52:17,866 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 10:52:17,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 10:52:17,869 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 10:52:17,870 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 10:52:17,871 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 10:52:17,880 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 10:52:17,881 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 10:52:17,886 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 10:52:17,887 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 10:52:17,892 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 10:52:17,893 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 10:52:17,894 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 10:52:17,895 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 10:52:17,897 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 10:52:17,898 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 10:52:17,898 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 10:52:17,899 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 10:52:17,900 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 10:52:17,900 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 10:52:17,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 10:52:17,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 10:52:17,903 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 10:52:17,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 10:52:17,904 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 10:52:17,904 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 10:52:17,905 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 10:52:17,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 10:52:17,906 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 10:52:17,925 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 10:52:17,925 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 10:52:17,926 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 10:52:17,926 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 10:52:17,927 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 10:52:17,927 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 10:52:17,928 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 10:52:17,928 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 10:52:17,928 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 10:52:17,928 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 10:52:17,929 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 10:52:17,929 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 10:52:17,929 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 10:52:17,929 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 10:52:17,929 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 10:52:17,930 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 10:52:17,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 10:52:17,930 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-10-04 10:52:17,930 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-10-04 10:52:17,930 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 10:52:17,931 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 10:52:17,931 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 10:52:17,931 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-10-04 10:52:17,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 10:52:17,932 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 10:52:17,932 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 10:52:17,932 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-10-04 10:52:17,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 10:52:17,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 10:52:17,932 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 10:52:17,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 10:52:17,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 10:52:17,996 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 10:52:17,998 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 10:52:17,999 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 10:52:18,000 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 10:52:18,000 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl' [2018-10-04 10:52:18,048 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 10:52:18,050 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 10:52:18,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 10:52:18,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 10:52:18,051 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 10:52:18,074 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 10:52:18" (1/1) ... [2018-10-04 10:52:18,086 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 10:52:18" (1/1) ... [2018-10-04 10:52:18,091 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 10:52:18,092 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 10:52:18,092 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 10:52:18,094 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 10:52:18,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 10:52:18,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 10:52:18,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 10:52:18,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:52:18" (1/1) ... [2018-10-04 10:52:18,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:52:18" (1/1) ... [2018-10-04 10:52:18,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:52:18" (1/1) ... [2018-10-04 10:52:18,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:52:18" (1/1) ... [2018-10-04 10:52:18,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:52:18" (1/1) ... [2018-10-04 10:52:18,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:52:18" (1/1) ... [2018-10-04 10:52:18,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:52:18" (1/1) ... [2018-10-04 10:52:18,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 10:52:18,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 10:52:18,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 10:52:18,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 10:52:18,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 10:52:18" (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 10:52:18,193 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2018-10-04 10:52:18,193 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2018-10-04 10:52:18,389 INFO L338 CfgBuilder]: Using library mode [2018-10-04 10:52:18,390 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 10:52:18 BoogieIcfgContainer [2018-10-04 10:52:18,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 10:52:18,391 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-10-04 10:52:18,391 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-10-04 10:52:18,402 INFO L276 PluginConnector]: CodeCheck initialized [2018-10-04 10:52:18,403 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 10:52:18" (1/1) ... [2018-10-04 10:52:18,416 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 10:52:18,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 8 states and 9 transitions. [2018-10-04 10:52:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-04 10:52:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 10:52:18,460 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:18,608 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 10:52:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 9 states and 12 transitions. [2018-10-04 10:52:18,955 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-10-04 10:52:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 10:52:18,955 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:18,978 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 10:52:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:19,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 13 states and 18 transitions. [2018-10-04 10:52:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2018-10-04 10:52:19,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 10:52:19,514 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:19,597 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 10:52:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 15 states and 24 transitions. [2018-10-04 10:52:20,237 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2018-10-04 10:52:20,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 10:52:20,238 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:20,718 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 10:52:20,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:21,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 16 states and 27 transitions. [2018-10-04 10:52:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 27 transitions. [2018-10-04 10:52:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 10:52:21,001 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:21,056 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 10:52:21,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 19 states and 34 transitions. [2018-10-04 10:52:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 34 transitions. [2018-10-04 10:52:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-04 10:52:21,481 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:21,544 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 10:52:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 18 states and 27 transitions. [2018-10-04 10:52:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2018-10-04 10:52:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 10:52:22,323 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:22,472 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 10:52:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 20 states and 30 transitions. [2018-10-04 10:52:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2018-10-04 10:52:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 10:52:22,815 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:22,883 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 10:52:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 22 states and 33 transitions. [2018-10-04 10:52:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2018-10-04 10:52:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-04 10:52:23,975 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:24,218 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 10:52:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 23 states and 35 transitions. [2018-10-04 10:52:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2018-10-04 10:52:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 10:52:24,687 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:24,767 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 10:52:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 25 states and 38 transitions. [2018-10-04 10:52:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 38 transitions. [2018-10-04 10:52:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 10:52:25,169 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:25,251 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 10:52:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 27 states and 41 transitions. [2018-10-04 10:52:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2018-10-04 10:52:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 10:52:25,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:25,645 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 10:52:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 28 states and 43 transitions. [2018-10-04 10:52:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 43 transitions. [2018-10-04 10:52:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-04 10:52:26,019 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:26,106 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 10:52:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 29 states and 44 transitions. [2018-10-04 10:52:26,643 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2018-10-04 10:52:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 10:52:26,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:26,726 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 10:52:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 31 states and 47 transitions. [2018-10-04 10:52:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2018-10-04 10:52:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 10:52:27,667 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:27,726 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 10:52:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 33 states and 50 transitions. [2018-10-04 10:52:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2018-10-04 10:52:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-04 10:52:28,103 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:28,189 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 10:52:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 34 states and 52 transitions. [2018-10-04 10:52:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 52 transitions. [2018-10-04 10:52:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 10:52:28,648 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:28,847 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 25 new depth: 19 [2018-10-04 10:52:28,864 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 10:52:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 36 states and 55 transitions. [2018-10-04 10:52:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2018-10-04 10:52:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 10:52:29,358 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:29,456 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 10:52:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 38 states and 58 transitions. [2018-10-04 10:52:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2018-10-04 10:52:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 10:52:29,851 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:29,896 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 10:52:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 39 states and 60 transitions. [2018-10-04 10:52:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2018-10-04 10:52:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 10:52:30,446 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:30,544 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 10:52:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 40 states and 62 transitions. [2018-10-04 10:52:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 62 transitions. [2018-10-04 10:52:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 10:52:31,178 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:31,268 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 10:52:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 42 states and 65 transitions. [2018-10-04 10:52:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2018-10-04 10:52:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:52:31,797 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:31,867 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 10:52:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 44 states and 68 transitions. [2018-10-04 10:52:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2018-10-04 10:52:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:52:32,587 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:33,100 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 10:52:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 45 states and 70 transitions. [2018-10-04 10:52:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 70 transitions. [2018-10-04 10:52:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-04 10:52:33,743 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:33,824 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 10:52:34,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 46 states and 71 transitions. [2018-10-04 10:52:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 71 transitions. [2018-10-04 10:52:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 10:52:34,588 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:34,838 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 10:52:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 48 states and 74 transitions. [2018-10-04 10:52:35,593 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 74 transitions. [2018-10-04 10:52:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 10:52:35,594 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:35,661 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 10:52:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 50 states and 77 transitions. [2018-10-04 10:52:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 77 transitions. [2018-10-04 10:52:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 10:52:36,203 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:36,560 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 10:52:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 51 states and 79 transitions. [2018-10-04 10:52:37,576 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 79 transitions. [2018-10-04 10:52:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-04 10:52:37,576 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:37,759 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 10:52:38,756 INFO L248 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 39 new depth: 32 [2018-10-04 10:52:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 52 states and 81 transitions. [2018-10-04 10:52:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2018-10-04 10:52:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 10:52:40,364 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:40,488 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 10:52:41,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 54 states and 84 transitions. [2018-10-04 10:52:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 84 transitions. [2018-10-04 10:52:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 10:52:41,685 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:41,954 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 10:52:43,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:43,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 56 states and 87 transitions. [2018-10-04 10:52:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2018-10-04 10:52:43,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 10:52:43,314 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:43,422 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 10:52:44,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 57 states and 89 transitions. [2018-10-04 10:52:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 89 transitions. [2018-10-04 10:52:44,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-04 10:52:44,179 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:44,248 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 10:52:46,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 58 states and 91 transitions. [2018-10-04 10:52:46,156 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 91 transitions. [2018-10-04 10:52:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 10:52:46,156 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:46,277 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 10:52:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:47,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 60 states and 94 transitions. [2018-10-04 10:52:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 94 transitions. [2018-10-04 10:52:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 10:52:47,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:47,680 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 10:52:48,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 62 states and 97 transitions. [2018-10-04 10:52:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. [2018-10-04 10:52:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 10:52:48,413 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:48,538 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 10:52:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 63 states and 99 transitions. [2018-10-04 10:52:49,399 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2018-10-04 10:52:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 10:52:49,400 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:50,103 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 10:52:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 64 states and 100 transitions. [2018-10-04 10:52:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2018-10-04 10:52:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-04 10:52:51,014 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:51,178 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 10:52:52,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 65 states and 102 transitions. [2018-10-04 10:52:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 102 transitions. [2018-10-04 10:52:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 10:52:52,572 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:52,875 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 10:52:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:53,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 67 states and 105 transitions. [2018-10-04 10:52:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 105 transitions. [2018-10-04 10:52:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 10:52:53,982 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:54,067 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 10:52:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-10-04 10:52:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 69 states and 108 transitions. [2018-10-04 10:52:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 108 transitions. [2018-10-04 10:52:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 10:52:54,807 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2018-10-04 10:52:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 10:52:54,920 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 10:52:55,953 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:384) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:404) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getWitnessInductive(BPredicateUnifier.java:397) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.restructurePredicateTrie(BPredicateUnifier.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicateInternal(BPredicateUnifier.java:246) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:214) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.biesenb.BPredicateUnifier.getOrConstructPredicate(BPredicateUnifier.java:295) 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 10:52:55,957 INFO L168 Benchmark]: Toolchain (without parser) took 37907.84 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 429.4 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 6.6 MB). Peak memory consumption was 436.0 MB. Max. memory is 7.1 GB. [2018-10-04 10:52:55,959 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 10:52:55,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 10:52:55,960 INFO L168 Benchmark]: Boogie Preprocessor took 23.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 10:52:55,960 INFO L168 Benchmark]: RCFGBuilder took 271.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 10:52:55,961 INFO L168 Benchmark]: CodeCheck took 37565.05 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 429.4 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -14.5 MB). Peak memory consumption was 414.8 MB. Max. memory is 7.1 GB. [2018-10-04 10:52:55,966 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 271.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * CodeCheck took 37565.05 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 429.4 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -14.5 MB). Peak memory consumption was 414.8 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_10-52-55-978.csv Received shutdown request...