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/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:58:01,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:58:01,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:58:01,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:58:01,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:58:01,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:58:01,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:58:01,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:58:01,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:58:01,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:58:01,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:58:01,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:58:01,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:58:01,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:58:01,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:58:01,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:58:01,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:58:01,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:58:01,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:58:01,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:58:01,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:58:01,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:58:01,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:58:01,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:58:01,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:58:01,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:58:01,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:58:01,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:58:01,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:58:01,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:58:01,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:58:01,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:58:01,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:58:01,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:58:01,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:58:01,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:58:01,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:58:01,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:58:01,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:58:01,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:58:01,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:58:01,874 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-05 11:58:01,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:58:01,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:58:01,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:58:01,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:58:01,894 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:58:01,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:58:01,894 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:58:01,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:58:01,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:58:01,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:58:01,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:58:01,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:58:01,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:58:01,896 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:58:01,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:58:01,896 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:58:01,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:58:01,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:58:01,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:58:01,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:58:01,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:58:01,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:58:01,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:58:01,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:58:01,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:58:01,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:58:01,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:58:01,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:58:01,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:58:01,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:58:01,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:58:01,941 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:58:01,942 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:58:01,943 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:58:01,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-05 11:58:02,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b44ac706/e2e6c7701bab45c392b94fced10df7f8/FLAG5cd80a7c9 [2019-09-05 11:58:02,400 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:58:02,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-05 11:58:02,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b44ac706/e2e6c7701bab45c392b94fced10df7f8/FLAG5cd80a7c9 [2019-09-05 11:58:02,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b44ac706/e2e6c7701bab45c392b94fced10df7f8 [2019-09-05 11:58:02,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:58:02,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:58:02,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:58:02,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:58:02,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:58:02,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:58:02" (1/1) ... [2019-09-05 11:58:02,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c1ea0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:02, skipping insertion in model container [2019-09-05 11:58:02,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:58:02" (1/1) ... [2019-09-05 11:58:02,837 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:58:02,858 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:58:03,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:58:03,057 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:58:03,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:58:03,202 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:58:03,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:03 WrapperNode [2019-09-05 11:58:03,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:58:03,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:58:03,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:58:03,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:58:03,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:03" (1/1) ... [2019-09-05 11:58:03,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:03" (1/1) ... [2019-09-05 11:58:03,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:03" (1/1) ... [2019-09-05 11:58:03,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:03" (1/1) ... [2019-09-05 11:58:03,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:03" (1/1) ... [2019-09-05 11:58:03,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:03" (1/1) ... [2019-09-05 11:58:03,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:03" (1/1) ... [2019-09-05 11:58:03,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:58:03,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:58:03,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:58:03,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:58:03,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:03" (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-05 11:58:03,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:58:03,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:58:03,293 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:58:03,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:58:03,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 11:58:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:58:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-05 11:58:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:58:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-05 11:58:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:58:03,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:58:03,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:58:03,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:58:03,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:58:03,652 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:58:03,652 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-05 11:58:03,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:58:03 BoogieIcfgContainer [2019-09-05 11:58:03,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:58:03,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:58:03,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:58:03,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:58:03,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:58:02" (1/3) ... [2019-09-05 11:58:03,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3271116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:58:03, skipping insertion in model container [2019-09-05 11:58:03,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:58:03" (2/3) ... [2019-09-05 11:58:03,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3271116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:58:03, skipping insertion in model container [2019-09-05 11:58:03,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:58:03" (3/3) ... [2019-09-05 11:58:03,664 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2019-09-05 11:58:03,672 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:58:03,680 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-09-05 11:58:03,696 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-09-05 11:58:03,734 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:58:03,735 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:58:03,735 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:58:03,735 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:58:03,735 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:58:03,735 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:58:03,735 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:58:03,736 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:58:03,736 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:58:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-09-05 11:58:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-05 11:58:03,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:03,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:03,757 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:03,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2019-09-05 11:58:03,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:03,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:03,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:03,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:03,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:03,955 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-05 11:58:03,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:03,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:58:03,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:58:03,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:58:03,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:03,972 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-09-05 11:58:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:04,009 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-09-05 11:58:04,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:58:04,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-09-05 11:58:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:04,021 INFO L225 Difference]: With dead ends: 51 [2019-09-05 11:58:04,021 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 11:58:04,024 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 11:58:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-09-05 11:58:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 11:58:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-09-05 11:58:04,064 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2019-09-05 11:58:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:04,064 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-09-05 11:58:04,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:58:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-09-05 11:58:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:58:04,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:04,066 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:04,066 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2019-09-05 11:58:04,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:04,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:04,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:04,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:04,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:04,132 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-05 11:58:04,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:04,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:58:04,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:58:04,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:58:04,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:58:04,139 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2019-09-05 11:58:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:04,209 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-09-05 11:58:04,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:58:04,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-09-05 11:58:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:04,212 INFO L225 Difference]: With dead ends: 51 [2019-09-05 11:58:04,212 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 11:58:04,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:58:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 11:58:04,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-09-05 11:58:04,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:58:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-09-05 11:58:04,231 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2019-09-05 11:58:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:04,232 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-09-05 11:58:04,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:58:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-09-05 11:58:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:58:04,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:04,233 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:04,234 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:04,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:04,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2019-09-05 11:58:04,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:04,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:04,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:04,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:04,318 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-05 11:58:04,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:04,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:58:04,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:58:04,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:58:04,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:04,321 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2019-09-05 11:58:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:04,369 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-09-05 11:58:04,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:58:04,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-05 11:58:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:04,371 INFO L225 Difference]: With dead ends: 60 [2019-09-05 11:58:04,372 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 11:58:04,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:04,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 11:58:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-09-05 11:58:04,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:58:04,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-05 11:58:04,379 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-09-05 11:58:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:04,380 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-05 11:58:04,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:58:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-05 11:58:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-05 11:58:04,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:04,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:04,381 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2019-09-05 11:58:04,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:04,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:04,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:04,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:04,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:04,432 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-05 11:58:04,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:04,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:58:04,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:58:04,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:58:04,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:04,434 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-09-05 11:58:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:04,466 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-09-05 11:58:04,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:58:04,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-05 11:58:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:04,467 INFO L225 Difference]: With dead ends: 54 [2019-09-05 11:58:04,467 INFO L226 Difference]: Without dead ends: 34 [2019-09-05 11:58:04,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:58:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-05 11:58:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-09-05 11:58:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 11:58:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-09-05 11:58:04,473 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2019-09-05 11:58:04,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:04,473 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-09-05 11:58:04,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:58:04,474 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-09-05 11:58:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:58:04,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:04,474 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:04,475 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:04,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:04,475 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2019-09-05 11:58:04,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:04,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:04,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:04,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:04,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:04,990 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 33 [2019-09-05 11:58:05,726 WARN L188 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 92 [2019-09-05 11:58:06,085 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 73 [2019-09-05 11:58:06,105 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-05 11:58:06,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:06,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-05 11:58:06,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:58:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:58:06,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:58:06,107 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-09-05 11:58:08,309 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 42 [2019-09-05 11:58:08,475 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 46 [2019-09-05 11:58:08,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:08,503 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-09-05 11:58:08,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-05 11:58:08,505 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-05 11:58:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:08,506 INFO L225 Difference]: With dead ends: 44 [2019-09-05 11:58:08,506 INFO L226 Difference]: Without dead ends: 29 [2019-09-05 11:58:08,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:58:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-05 11:58:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-09-05 11:58:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 11:58:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-05 11:58:08,512 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2019-09-05 11:58:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:08,512 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-05 11:58:08,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:58:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-05 11:58:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-05 11:58:08,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:08,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:08,514 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:08,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:08,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2019-09-05 11:58:08,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:08,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:08,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:08,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:08,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:08,580 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-05 11:58:08,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:58:08,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:58:08,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:58:08,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:58:08,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:58:08,582 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2019-09-05 11:58:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:08,646 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-05 11:58:08,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:58:08,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-05 11:58:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:08,648 INFO L225 Difference]: With dead ends: 42 [2019-09-05 11:58:08,649 INFO L226 Difference]: Without dead ends: 40 [2019-09-05 11:58:08,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:58:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-05 11:58:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2019-09-05 11:58:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 11:58:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-05 11:58:08,658 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2019-09-05 11:58:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:08,658 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-05 11:58:08,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:58:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-05 11:58:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:58:08,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:58:08,660 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:58:08,660 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:58:08,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:58:08,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1309636523, now seen corresponding path program 1 times [2019-09-05 11:58:08,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:58:08,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:58:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:08,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:08,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:58:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:08,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:58:08,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:58:08,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:58:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:58:08,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:58:08,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:58:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:58:11,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:58:11,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-09-05 11:58:11,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:58:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:58:11,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2019-09-05 11:58:11,158 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2019-09-05 11:58:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:58:16,174 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-09-05 11:58:16,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:58:16,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-05 11:58:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:58:16,198 INFO L225 Difference]: With dead ends: 30 [2019-09-05 11:58:16,198 INFO L226 Difference]: Without dead ends: 0 [2019-09-05 11:58:16,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=22, Invalid=33, Unknown=1, NotChecked=0, Total=56 [2019-09-05 11:58:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-05 11:58:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-05 11:58:16,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-05 11:58:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-05 11:58:16,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-09-05 11:58:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:58:16,199 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-05 11:58:16,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:58:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-05 11:58:16,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-05 11:58:16,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-05 11:58:16,847 WARN L188 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-05 11:58:19,099 WARN L188 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-05 11:58:19,234 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-09-05 11:58:19,362 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2019-09-05 11:58:19,365 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:58:19,365 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:58:19,365 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:58:19,365 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-05 11:58:19,365 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-05 11:58:19,365 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-05 11:58:19,365 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-05 11:58:19,365 INFO L446 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2019-09-05 11:58:19,365 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 163) no Hoare annotation was computed. [2019-09-05 11:58:19,366 INFO L439 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (or (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (- 4294967296) (div (+ main_~main__index2~0 4294867297) 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) (= main_~__VERIFIER_assert__cond~0 1) (let ((.cse5 (div main_~main__index2~0 4294967296)) (.cse6 (div main_~main__index1~0 4294967296))) (or (let ((.cse4 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse3 (select .cse4 (+ (* (- 17179869184) .cse6) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse1 (select .cse4 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse5))))) (let ((.cse2 (+ .cse3 (* 4294967296 (div .cse1 4294967296)))) (.cse0 (* 4294967296 (div .cse3 4294967296)))) (and (<= (+ .cse0 .cse1) .cse2) (< .cse2 (+ .cse0 .cse1 1)))))) (<= (+ main_~main__index1~0 (* 4294967296 .cse5)) (+ (* 4294967296 .cse6) main_~main__index2~0))))) (= main_~main__loop_entered~0 0)) [2019-09-05 11:58:19,366 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-09-05 11:58:19,366 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2019-09-05 11:58:19,367 INFO L439 ceAbstractionStarter]: At program point L114(lines 94 123) the Hoare annotation is: (let ((.cse7 (div main_~main__index1~0 4294967296)) (.cse6 (div main_~main__index2~0 4294967296))) (let ((.cse0 (= main_~__VERIFIER_assert__cond~0 1)) (.cse8 (* 4294967296 .cse6)) (.cse9 (+ (* 4294967296 .cse7) main_~main__index2~0))) (or (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (- 4294967296) (div (+ main_~main__index2~0 4294867297) 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) .cse0 (or (let ((.cse5 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse4 (select .cse5 (+ (* (- 17179869184) .cse7) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse2 (select .cse5 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse6))))) (let ((.cse3 (+ .cse4 (* 4294967296 (div .cse2 4294967296)))) (.cse1 (* 4294967296 (div .cse4 4294967296)))) (and (<= (+ .cse1 .cse2) .cse3) (< .cse3 (+ .cse1 .cse2 1)))))) (<= (+ main_~main__index1~0 .cse8) .cse9))) (and (<= main_~main__index2~0 (+ .cse8 99999)) .cse0 (not (= main_~__VERIFIER_assert__cond~2 0)) (<= (+ main_~main__index1~0 .cse8 1) .cse9))))) [2019-09-05 11:58:19,367 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-09-05 11:58:19,367 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-09-05 11:58:19,367 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (- 4294967296) (div (+ main_~main__index2~0 4294867297) 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) [2019-09-05 11:58:19,367 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2019-09-05 11:58:19,367 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-09-05 11:58:19,368 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div main_~main__index2~0 4294967296)))) (let ((.cse0 (<= main_~main__index2~0 (+ .cse3 99999))) (.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (<= (+ main_~main__index1~0 .cse3 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) (or (and (= 1 main_~main____CPAchecker_TMP_0~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= main_~__VERIFIER_assert__cond~1 0)) .cse2)))) [2019-09-05 11:58:19,368 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-09-05 11:58:19,368 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2019-09-05 11:58:19,368 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-09-05 11:58:19,368 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-09-05 11:58:19,368 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-09-05 11:58:19,368 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2019-09-05 11:58:19,369 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-09-05 11:58:19,369 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= 1 main_~main____CPAchecker_TMP_0~0) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2019-09-05 11:58:19,369 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 163) no Hoare annotation was computed. [2019-09-05 11:58:19,369 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 9 163) the Hoare annotation is: true [2019-09-05 11:58:19,369 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-09-05 11:58:19,369 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-09-05 11:58:19,370 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-09-05 11:58:19,370 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-09-05 11:58:19,370 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-09-05 11:58:19,370 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-09-05 11:58:19,370 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-09-05 11:58:19,378 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,379 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,380 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,387 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,388 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,391 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,394 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,395 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,395 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,395 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,395 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,396 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 11:58:19 BoogieIcfgContainer [2019-09-05 11:58:19,400 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-05 11:58:19,402 INFO L168 Benchmark]: Toolchain (without parser) took 16578.27 ms. Allocated memory was 132.6 MB in the beginning and 262.7 MB in the end (delta: 130.0 MB). Free memory was 88.1 MB in the beginning and 120.2 MB in the end (delta: -32.1 MB). Peak memory consumption was 97.9 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:19,403 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 11:58:19,404 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.64 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 87.9 MB in the beginning and 175.0 MB in the end (delta: -87.2 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:19,404 INFO L168 Benchmark]: Boogie Preprocessor took 39.01 ms. Allocated memory is still 199.2 MB. Free memory was 175.0 MB in the beginning and 173.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:19,405 INFO L168 Benchmark]: RCFGBuilder took 412.08 ms. Allocated memory is still 199.2 MB. Free memory was 173.1 MB in the beginning and 154.8 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:19,406 INFO L168 Benchmark]: TraceAbstraction took 15742.39 ms. Allocated memory was 199.2 MB in the beginning and 262.7 MB in the end (delta: 63.4 MB). Free memory was 154.8 MB in the beginning and 120.2 MB in the end (delta: 34.6 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. [2019-09-05 11:58:19,410 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.20 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 378.64 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 87.9 MB in the beginning and 175.0 MB in the end (delta: -87.2 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.01 ms. Allocated memory is still 199.2 MB. Free memory was 175.0 MB in the beginning and 173.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 412.08 ms. Allocated memory is still 199.2 MB. Free memory was 173.1 MB in the beginning and 154.8 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15742.39 ms. Allocated memory was 199.2 MB in the beginning and 262.7 MB in the end (delta: 63.4 MB). Free memory was 154.8 MB in the beginning and 120.2 MB in the end (delta: 34.6 MB). Peak memory consumption was 98.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant [2019-09-05 11:58:19,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,426 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,427 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,428 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,429 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,430 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((main__index1 <= 4294967296 * ((main__index1 + -4294967296 * ((main__index2 + 4294867297) / 4294967296) + -1) / 4294967296) + main__index2 + 1 && __VERIFIER_assert__cond == 1) && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] + 1) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2)) || main__loop_entered == 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant [2019-09-05 11:58:19,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,431 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,432 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,433 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,434 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-05 11:58:19,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((main__index1 <= 4294967296 * ((main__index1 + -4294967296 * ((main__index2 + 4294867297) / 4294967296) + -1) / 4294967296) + main__index2 + 1 && __VERIFIER_assert__cond == 1) && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] + 1) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2)) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((main__index1 <= 4294967296 * ((main__index1 + -4294967296 * ((main__index2 + 4294867297) / 4294967296) + -1) / 4294967296) + main__index2 + 1 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 3 error locations. SAFE Result, 15.6s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 179 SDslu, 262 SDs, 0 SdLazy, 136 SolverSat, 15 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, 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, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 540 HoareAnnotationTreeSize, 12 FomulaSimplifications, 479 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 144 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 49959 SizeOfPredicates, 2 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...