java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/ludcmp.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:57:26,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:57:26,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:57:26,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:57:26,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:57:26,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:57:26,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:57:26,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:57:26,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:57:26,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:57:26,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:57:26,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:57:26,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:57:26,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:57:26,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:57:26,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:57:26,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:57:26,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:57:26,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:57:26,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:57:26,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:57:26,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:57:26,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:57:26,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:57:26,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:57:26,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:57:26,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:57:26,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:57:26,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:57:26,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:57:26,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:57:26,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:57:26,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:57:26,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:57:26,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:57:26,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:57:26,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:57:26,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:57:26,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:57:26,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:57:26,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:57:26,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 12:57:26,925 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:57:26,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:57:26,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:57:26,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:57:26,927 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:57:26,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:57:26,928 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:57:26,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:57:26,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:57:26,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:57:26,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:57:26,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:57:26,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:57:26,929 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:57:26,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:57:26,929 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:57:26,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:57:26,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:57:26,930 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:57:26,930 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:57:26,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:57:26,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:57:26,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:57:26,931 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:57:26,931 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:57:26,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:57:26,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:57:26,932 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:57:26,932 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:57:26,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:57:26,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:57:26,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:57:26,977 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:57:26,978 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:57:26,978 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/ludcmp.c [2019-09-20 12:57:27,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ace7dd35/312bead3f3194d65abc51b2fffa563d1/FLAG2e8067acd [2019-09-20 12:57:27,478 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:57:27,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c [2019-09-20 12:57:27,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ace7dd35/312bead3f3194d65abc51b2fffa563d1/FLAG2e8067acd [2019-09-20 12:57:27,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ace7dd35/312bead3f3194d65abc51b2fffa563d1 [2019-09-20 12:57:27,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:57:27,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:57:27,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:57:27,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:57:27,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:57:27,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:57:27" (1/1) ... [2019-09-20 12:57:27,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fddbff9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:27, skipping insertion in model container [2019-09-20 12:57:27,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:57:27" (1/1) ... [2019-09-20 12:57:27,896 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:57:27,917 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:57:28,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:57:28,144 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:57:28,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:57:28,291 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:57:28,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28 WrapperNode [2019-09-20 12:57:28,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:57:28,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:57:28,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:57:28,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:57:28,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... [2019-09-20 12:57:28,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:57:28,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:57:28,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:57:28,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:57:28,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:57:28,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:57:28,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:57:28,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:57:28,399 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2019-09-20 12:57:28,400 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:57:28,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2019-09-20 12:57:28,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:57:28,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:57:28,400 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2019-09-20 12:57:28,400 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2019-09-20 12:57:28,400 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:57:28,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-09-20 12:57:28,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-09-20 12:57:28,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 12:57:28,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 12:57:28,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:57:28,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:57:28,816 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:57:28,816 INFO L283 CfgBuilder]: Removed 11 assume(true) statements. [2019-09-20 12:57:28,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:57:28 BoogieIcfgContainer [2019-09-20 12:57:28,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:57:28,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:57:28,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:57:28,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:57:28,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:57:27" (1/3) ... [2019-09-20 12:57:28,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f4ba06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:57:28, skipping insertion in model container [2019-09-20 12:57:28,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:57:28" (2/3) ... [2019-09-20 12:57:28,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f4ba06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:57:28, skipping insertion in model container [2019-09-20 12:57:28,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:57:28" (3/3) ... [2019-09-20 12:57:28,827 INFO L109 eAbstractionObserver]: Analyzing ICFG ludcmp.c [2019-09-20 12:57:28,837 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:57:28,844 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:57:28,860 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:57:28,889 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:57:28,890 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:57:28,890 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:57:28,890 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:57:28,890 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:57:28,891 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:57:28,891 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:57:28,891 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:57:28,891 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:57:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2019-09-20 12:57:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 12:57:28,916 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:28,917 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:28,919 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:28,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:28,923 INFO L82 PathProgramCache]: Analyzing trace with hash 406725423, now seen corresponding path program 1 times [2019-09-20 12:57:28,925 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:28,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:28,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:28,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:28,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:29,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:29,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:57:29,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:57:29,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:57:29,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:57:29,111 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2019-09-20 12:57:29,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:29,140 INFO L93 Difference]: Finished difference Result 122 states and 178 transitions. [2019-09-20 12:57:29,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:57:29,141 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-09-20 12:57:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:29,147 INFO L225 Difference]: With dead ends: 122 [2019-09-20 12:57:29,148 INFO L226 Difference]: Without dead ends: 20 [2019-09-20 12:57:29,151 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:57:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-20 12:57:29,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-20 12:57:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-20 12:57:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-09-20 12:57:29,184 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2019-09-20 12:57:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:29,184 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-09-20 12:57:29,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:57:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-09-20 12:57:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 12:57:29,186 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:29,186 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:29,186 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:29,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:29,187 INFO L82 PathProgramCache]: Analyzing trace with hash 394719650, now seen corresponding path program 1 times [2019-09-20 12:57:29,187 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:29,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:29,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:29,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:57:29,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:57:29,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:57:29,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:57:29,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:57:29,293 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 4 states. [2019-09-20 12:57:29,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:29,373 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-09-20 12:57:29,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:57:29,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-20 12:57:29,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:29,375 INFO L225 Difference]: With dead ends: 38 [2019-09-20 12:57:29,375 INFO L226 Difference]: Without dead ends: 24 [2019-09-20 12:57:29,376 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:57:29,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-20 12:57:29,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-09-20 12:57:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-20 12:57:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-09-20 12:57:29,382 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2019-09-20 12:57:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:29,382 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-09-20 12:57:29,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:57:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-09-20 12:57:29,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 12:57:29,383 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:29,383 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:29,384 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:29,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:29,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1180233829, now seen corresponding path program 1 times [2019-09-20 12:57:29,384 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:29,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:29,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:29,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:29,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:29,495 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:29,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 12:57:29,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:29,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:29,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-09-20 12:57:29,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:57:29,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:57:29,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:57:29,651 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 7 states. [2019-09-20 12:57:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:29,708 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-09-20 12:57:29,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:57:29,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-20 12:57:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:29,710 INFO L225 Difference]: With dead ends: 43 [2019-09-20 12:57:29,710 INFO L226 Difference]: Without dead ends: 28 [2019-09-20 12:57:29,711 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:57:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-20 12:57:29,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-09-20 12:57:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-20 12:57:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-20 12:57:29,717 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-09-20 12:57:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:29,717 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-20 12:57:29,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:57:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-20 12:57:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:57:29,718 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:29,719 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:29,719 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:29,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:29,721 INFO L82 PathProgramCache]: Analyzing trace with hash -232421100, now seen corresponding path program 2 times [2019-09-20 12:57:29,721 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:29,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:29,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:29,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:29,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:29,846 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:29,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:57:29,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:57:29,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:29,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 12:57:29,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:29,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:29,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-09-20 12:57:29,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:57:29,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:57:29,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:57:29,978 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 9 states. [2019-09-20 12:57:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:30,036 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-09-20 12:57:30,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:57:30,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-20 12:57:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:30,038 INFO L225 Difference]: With dead ends: 51 [2019-09-20 12:57:30,039 INFO L226 Difference]: Without dead ends: 32 [2019-09-20 12:57:30,039 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:57:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-20 12:57:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-09-20 12:57:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-20 12:57:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-20 12:57:30,045 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2019-09-20 12:57:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:30,045 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-20 12:57:30,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:57:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-20 12:57:30,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 12:57:30,047 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:30,047 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:30,047 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:30,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:30,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1802018317, now seen corresponding path program 3 times [2019-09-20 12:57:30,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:30,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:30,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:30,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:30,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:30,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:30,127 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:57:30,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:30,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-20 12:57:30,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:30,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 12:57:30,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-20 12:57:30,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:57:30,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-20 12:57:30,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:57:30,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:57:30,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:57:30,213 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 9 states. [2019-09-20 12:57:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:30,407 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2019-09-20 12:57:30,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 12:57:30,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-09-20 12:57:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:30,411 INFO L225 Difference]: With dead ends: 93 [2019-09-20 12:57:30,411 INFO L226 Difference]: Without dead ends: 70 [2019-09-20 12:57:30,413 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-09-20 12:57:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-20 12:57:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 51. [2019-09-20 12:57:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-20 12:57:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-09-20 12:57:30,440 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 24 [2019-09-20 12:57:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:30,440 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-09-20 12:57:30,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:57:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2019-09-20 12:57:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 12:57:30,442 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:30,442 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:30,443 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:30,443 INFO L82 PathProgramCache]: Analyzing trace with hash -479010360, now seen corresponding path program 1 times [2019-09-20 12:57:30,444 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:30,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:30,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:30,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:30,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:30,833 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:30,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:30,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-20 12:57:30,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:31,054 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:31,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:31,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-09-20 12:57:31,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-20 12:57:31,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-20 12:57:31,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-09-20 12:57:31,060 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 18 states. [2019-09-20 12:57:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:32,407 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2019-09-20 12:57:32,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-20 12:57:32,408 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2019-09-20 12:57:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:32,410 INFO L225 Difference]: With dead ends: 219 [2019-09-20 12:57:32,411 INFO L226 Difference]: Without dead ends: 177 [2019-09-20 12:57:32,413 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=440, Invalid=1366, Unknown=0, NotChecked=0, Total=1806 [2019-09-20 12:57:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-20 12:57:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 121. [2019-09-20 12:57:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-20 12:57:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2019-09-20 12:57:32,430 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 28 [2019-09-20 12:57:32,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:32,431 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2019-09-20 12:57:32,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-20 12:57:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2019-09-20 12:57:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 12:57:32,432 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:32,432 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:32,432 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:32,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:32,433 INFO L82 PathProgramCache]: Analyzing trace with hash -801997631, now seen corresponding path program 2 times [2019-09-20 12:57:32,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:32,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:32,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:57:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:57:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:32,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:57:32,507 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 12:57:32,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:57:32,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:57:32,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:57:32,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:57:32,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:57:32,635 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:57:32,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:57:32,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-09-20 12:57:32,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-20 12:57:32,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-20 12:57:32,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2019-09-20 12:57:32,640 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand 15 states. [2019-09-20 12:57:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:57:32,725 INFO L93 Difference]: Finished difference Result 333 states and 419 transitions. [2019-09-20 12:57:32,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:57:32,726 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2019-09-20 12:57:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:57:32,729 INFO L225 Difference]: With dead ends: 333 [2019-09-20 12:57:32,729 INFO L226 Difference]: Without dead ends: 221 [2019-09-20 12:57:32,730 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=139, Unknown=0, NotChecked=0, Total=240 [2019-09-20 12:57:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-09-20 12:57:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 144. [2019-09-20 12:57:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-09-20 12:57:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 179 transitions. [2019-09-20 12:57:32,747 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 179 transitions. Word has length 32 [2019-09-20 12:57:32,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:57:32,747 INFO L475 AbstractCegarLoop]: Abstraction has 144 states and 179 transitions. [2019-09-20 12:57:32,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-20 12:57:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 179 transitions. [2019-09-20 12:57:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 12:57:32,749 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:57:32,749 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:57:32,749 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:57:32,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:57:32,749 INFO L82 PathProgramCache]: Analyzing trace with hash -850791622, now seen corresponding path program 3 times [2019-09-20 12:57:32,749 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:57:32,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:57:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:32,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:57:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:57:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 12:57:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-20 12:57:32,833 INFO L474 BasicCegarLoop]: Counterexample might be feasible [2019-09-20 12:57:32,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:57:32 BoogieIcfgContainer [2019-09-20 12:57:32,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 12:57:32,889 INFO L168 Benchmark]: Toolchain (without parser) took 5005.99 ms. Allocated memory was 135.8 MB in the beginning and 271.6 MB in the end (delta: 135.8 MB). Free memory was 84.5 MB in the beginning and 114.4 MB in the end (delta: -29.9 MB). Peak memory consumption was 105.9 MB. Max. memory is 7.1 GB. [2019-09-20 12:57:32,890 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 103.0 MB in the beginning and 102.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 12:57:32,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 409.95 ms. Allocated memory was 135.8 MB in the beginning and 197.7 MB in the end (delta: 61.9 MB). Free memory was 84.3 MB in the beginning and 173.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-09-20 12:57:32,891 INFO L168 Benchmark]: Boogie Preprocessor took 51.17 ms. Allocated memory is still 197.7 MB. Free memory was 173.0 MB in the beginning and 170.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-20 12:57:32,892 INFO L168 Benchmark]: RCFGBuilder took 474.08 ms. Allocated memory is still 197.7 MB. Free memory was 170.4 MB in the beginning and 143.2 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2019-09-20 12:57:32,893 INFO L168 Benchmark]: TraceAbstraction took 4067.13 ms. Allocated memory was 197.7 MB in the beginning and 271.6 MB in the end (delta: 73.9 MB). Free memory was 143.2 MB in the beginning and 114.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. [2019-09-20 12:57:32,897 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 135.8 MB. Free memory was 103.0 MB in the beginning and 102.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 409.95 ms. Allocated memory was 135.8 MB in the beginning and 197.7 MB in the end (delta: 61.9 MB). Free memory was 84.3 MB in the beginning and 173.0 MB in the end (delta: -88.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.17 ms. Allocated memory is still 197.7 MB. Free memory was 173.0 MB in the beginning and 170.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 474.08 ms. Allocated memory is still 197.7 MB. Free memory was 170.4 MB in the beginning and 143.2 MB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4067.13 ms. Allocated memory was 197.7 MB in the beginning and 271.6 MB in the end (delta: 73.9 MB). Free memory was 143.2 MB in the beginning and 114.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 102.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 5]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of to_real at line 96, overapproximation of someBinaryArithmeticDOUBLEoperation at line 98. Possible FailurePath: [L69] double a[50][50], b[50], x[50]; VAL [\old(a)=20009, \old(a)=20012, \old(b)=20005, \old(b)=20015, \old(x)=20006, \old(x)=20007, a={1:0}, b={-1:0}, x={2:0}] [L86] int i, j, nmax = 50, n = 5, chkerr; [L87] double eps, w; [L89] eps = 1.0e-6 [L91] i = 0 VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, n=5, nmax=50, x={2:0}] [L91] COND TRUE i <= n [L93] w = 0.0 [L94] j = 0 VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, w=0, x={2:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, w=0, x={2:0}] [L97] COND TRUE i == j [L97] EXPR a[i][j] [L97] a[i][j] *= 10.0 [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={2:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={2:0}] [L97] COND FALSE !(i == j) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={2:0}] [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={2:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={2:0}] [L97] COND FALSE !(i == j) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={2:0}] [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={2:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={2:0}] [L97] COND FALSE !(i == j) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={2:0}] [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={2:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={2:0}] [L97] COND FALSE !(i == j) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={2:0}] [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={2:0}] [L94] COND TRUE j <= n [L96] a[i][j] = (i + 1) + (j + 1) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={2:0}] [L97] COND FALSE !(i == j) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={2:0}] [L98] EXPR a[i][j] [L98] w += a[i][j] [L94] j++ VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={2:0}] [L94] COND FALSE !(j <= n) VAL [a={1:0}, b={-1:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={2:0}] [L100] CALL __VERIFIER_assert(i==2) VAL [\old(cond)=0, a={1:0}, b={-1:0}, x={2:0}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, a={1:0}, b={-1:0}, cond=0, x={2:0}] [L5] __VERIFIER_error() VAL [\old(cond)=0, a={1:0}, b={-1:0}, cond=0, x={2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 1 error locations. UNSAFE Result, 4.0s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 178 SDtfs, 397 SDslu, 459 SDs, 0 SdLazy, 460 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 161 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 300 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 29688 SizeOfPredicates, 10 NumberOfNonLiveVariables, 578 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 15/190 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...