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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loops/heavy-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:59:48,975 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:59:48,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:59:48,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:59:48,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:59:48,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:59:48,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:59:48,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:59:49,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:59:49,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:59:49,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:59:49,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:59:49,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:59:49,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:59:49,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:59:49,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:59:49,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:59:49,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:59:49,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:59:49,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:59:49,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:59:49,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:59:49,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:59:49,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:59:49,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:59:49,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:59:49,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:59:49,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:59:49,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:59:49,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:59:49,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:59:49,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:59:49,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:59:49,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:59:49,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:59:49,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:59:49,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:59:49,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:59:49,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:59:49,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:59:49,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:59:49,060 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-10-13 22:59:49,074 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:59:49,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:59:49,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:59:49,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:59:49,076 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:59:49,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:59:49,076 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:59:49,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:59:49,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:59:49,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:59:49,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:59:49,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:59:49,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:59:49,078 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:59:49,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:59:49,078 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:59:49,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:59:49,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:59:49,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:59:49,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:59:49,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:59:49,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:59:49,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:59:49,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:59:49,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:59:49,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:59:49,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:59:49,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:59:49,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:59:49,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:59:49,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:59:49,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:59:49,406 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:59:49,407 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:59:49,407 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/heavy-2.c [2019-10-13 22:59:49,482 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08036444/f8d793287a6c46ca94bae1ad2952e466/FLAG5e790c77f [2019-10-13 22:59:49,978 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:59:49,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/heavy-2.c [2019-10-13 22:59:49,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08036444/f8d793287a6c46ca94bae1ad2952e466/FLAG5e790c77f [2019-10-13 22:59:50,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08036444/f8d793287a6c46ca94bae1ad2952e466 [2019-10-13 22:59:50,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:59:50,364 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:59:50,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:59:50,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:59:50,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:59:50,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:50" (1/1) ... [2019-10-13 22:59:50,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bda3564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:50, skipping insertion in model container [2019-10-13 22:59:50,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:50" (1/1) ... [2019-10-13 22:59:50,385 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:59:50,405 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:59:50,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:59:50,645 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:59:50,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:59:50,809 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:59:50,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:50 WrapperNode [2019-10-13 22:59:50,810 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:59:50,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:59:50,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:59:50,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:59:50,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:50" (1/1) ... [2019-10-13 22:59:50,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:50" (1/1) ... [2019-10-13 22:59:50,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:50" (1/1) ... [2019-10-13 22:59:50,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:50" (1/1) ... [2019-10-13 22:59:50,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:50" (1/1) ... [2019-10-13 22:59:50,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:50" (1/1) ... [2019-10-13 22:59:50,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:50" (1/1) ... [2019-10-13 22:59:50,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:59:50,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:59:50,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:59:50,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:59:50,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:50" (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-10-13 22:59:50,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:59:50,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:59:50,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:59:50,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:59:50,912 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:59:50,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:59:50,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:59:50,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:59:50,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 22:59:50,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-13 22:59:50,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:59:50,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:59:51,258 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:59:51,259 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 22:59:51,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:51 BoogieIcfgContainer [2019-10-13 22:59:51,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:59:51,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:59:51,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:59:51,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:59:51,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:59:50" (1/3) ... [2019-10-13 22:59:51,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4c366e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:51, skipping insertion in model container [2019-10-13 22:59:51,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:50" (2/3) ... [2019-10-13 22:59:51,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4c366e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:51, skipping insertion in model container [2019-10-13 22:59:51,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:51" (3/3) ... [2019-10-13 22:59:51,268 INFO L109 eAbstractionObserver]: Analyzing ICFG heavy-2.c [2019-10-13 22:59:51,278 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:59:51,286 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:59:51,298 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:59:51,319 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:59:51,320 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:59:51,320 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:59:51,320 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:59:51,321 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:59:51,321 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:59:51,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:59:51,321 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:59:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-10-13 22:59:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-10-13 22:59:51,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:51,342 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:51,344 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:51,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:51,349 INFO L82 PathProgramCache]: Analyzing trace with hash -12510755, now seen corresponding path program 1 times [2019-10-13 22:59:51,358 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:51,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440913535] [2019-10-13 22:59:51,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:51,358 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:51,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:51,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440913535] [2019-10-13 22:59:51,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:51,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:59:51,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587725955] [2019-10-13 22:59:51,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:59:51,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:51,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:59:51,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:59:51,579 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-10-13 22:59:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:51,643 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-10-13 22:59:51,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:59:51,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-10-13 22:59:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:51,656 INFO L225 Difference]: With dead ends: 25 [2019-10-13 22:59:51,657 INFO L226 Difference]: Without dead ends: 14 [2019-10-13 22:59:51,660 INFO L600 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-10-13 22:59:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-13 22:59:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-10-13 22:59:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-13 22:59:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-10-13 22:59:51,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2019-10-13 22:59:51,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:51,709 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-10-13 22:59:51,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:59:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-10-13 22:59:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 22:59:51,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:51,710 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:51,710 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash 821858575, now seen corresponding path program 1 times [2019-10-13 22:59:51,711 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:51,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461874600] [2019-10-13 22:59:51,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:51,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:51,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:51,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461874600] [2019-10-13 22:59:51,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:51,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:59:51,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145447859] [2019-10-13 22:59:51,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:59:51,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:51,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:59:51,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:59:51,799 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2019-10-13 22:59:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:51,834 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2019-10-13 22:59:51,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:59:51,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-13 22:59:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:51,837 INFO L225 Difference]: With dead ends: 20 [2019-10-13 22:59:51,837 INFO L226 Difference]: Without dead ends: 14 [2019-10-13 22:59:51,839 INFO L600 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-10-13 22:59:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-13 22:59:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-10-13 22:59:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-13 22:59:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-10-13 22:59:51,846 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2019-10-13 22:59:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:51,846 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-10-13 22:59:51,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:59:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-10-13 22:59:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 22:59:51,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:51,848 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:51,848 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:51,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1551678377, now seen corresponding path program 1 times [2019-10-13 22:59:51,850 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:51,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14193771] [2019-10-13 22:59:51,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:51,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:51,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:51,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14193771] [2019-10-13 22:59:51,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532572897] [2019-10-13 22:59:51,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:52,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 22:59:52,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:52,097 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:52,123 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 22:59:52,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [4] total 7 [2019-10-13 22:59:52,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431829990] [2019-10-13 22:59:52,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:59:52,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:52,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:59:52,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 22:59:52,126 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 5 states. [2019-10-13 22:59:52,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:52,196 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2019-10-13 22:59:52,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 22:59:52,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-13 22:59:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:52,198 INFO L225 Difference]: With dead ends: 27 [2019-10-13 22:59:52,198 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 22:59:52,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-13 22:59:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 22:59:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-10-13 22:59:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-13 22:59:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-10-13 22:59:52,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2019-10-13 22:59:52,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:52,205 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-10-13 22:59:52,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:59:52,205 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-10-13 22:59:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 22:59:52,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:52,220 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:52,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:52,425 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:52,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:52,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1033585897, now seen corresponding path program 1 times [2019-10-13 22:59:52,426 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:52,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714910093] [2019-10-13 22:59:52,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:52,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:52,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:52,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714910093] [2019-10-13 22:59:52,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083856379] [2019-10-13 22:59:52,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:52,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 22:59:52,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 22:59:52,713 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 22:59:52,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [281369157] [2019-10-13 22:59:52,872 INFO L162 IcfgInterpreter]: Started Sifa with 11 locations of interest [2019-10-13 22:59:52,873 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:52,881 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:52,892 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:52,893 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:53,121 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 36 for LOIs [2019-10-13 22:59:54,379 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:54,483 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:54,573 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:54,683 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:54,768 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:54,857 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:54,959 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:55,057 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:55,159 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:55,245 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:55,327 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:55,414 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:55,791 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:55,863 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:55,934 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:56,001 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:56,102 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:56,171 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:58,359 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |v_#memory_int_29| |~#array~0.base|)) (.cse1 (mod main_~j~0 4294967296))) (= (select .cse0 (+ |~#array~0.offset| .cse1 (- 4294967296))) (mod (+ (select .cse0 (+ (mod (+ main_~k~0 4294967295) 4294967296) |~#array~0.offset|)) (select .cse0 (+ |~#array~0.offset| .cse1))) 256))) [2019-10-13 22:59:58,473 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:58,546 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:58,828 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:58,895 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:58,967 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:59,044 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:59,132 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:59,211 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:59,288 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:59,361 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:59,672 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:59,744 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:59,805 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:59:59,855 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,135 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,186 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,233 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,287 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,355 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,402 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,468 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,544 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,610 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,660 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,720 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,765 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,832 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,885 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,937 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:00,984 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,025 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,074 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,124 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,193 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,263 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,315 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,366 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,419 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,469 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,733 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,777 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:01,996 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:02,259 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:02,304 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:02,348 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:02,579 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:02,833 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:02,882 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:02,941 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:02,991 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:03,032 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:03,282 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:03,324 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:03,577 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:03,628 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:03,668 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:03,892 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:03,935 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:03,979 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,028 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,076 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,124 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,212 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,271 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,324 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,363 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,644 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,694 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,738 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,782 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:04,821 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,083 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,123 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,165 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,206 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,245 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,288 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,380 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,446 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,489 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,531 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,572 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,611 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,654 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,692 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,739 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,778 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:05,822 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:06,037 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:06,079 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:06,118 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:06,161 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:06,204 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:06,243 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:07,493 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 451 [2019-10-13 23:00:07,716 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:07,729 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:07,910 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:07,944 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:08,389 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:08,418 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:08,721 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:08,850 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:09,194 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 23:00:09,385 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 22 for LOIs [2019-10-13 23:00:09,391 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:00:09,391 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:00:09,391 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (<= |~#array~0.offset| 0) (= 1048576 (select |#length| |~#array~0.base|)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (< |~#array~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1) (select |#memory_int| |~#array~0.base|)) (<= 0 |~#array~0.offset|) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= |#NULL.offset| 0) (= 0 |~#array~0.offset|) (not (= 0 |~#array~0.base|))) [2019-10-13 23:00:09,392 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (<= |~#array~0.offset| 0) (= 1048576 (select |#length| |~#array~0.base|)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (< |~#array~0.base| |#StackHeapBarrier|) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |~#array~0.offset|) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= 0 |~#array~0.offset|) (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1)) (not (= 0 |~#array~0.base|))) [2019-10-13 23:00:09,392 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 278#(and (<= |~#array~0.offset| 0) (= 0 |#NULL.base|) (= 0 (select (store |old(#valid)| 0 0) |~#array~0.base|)) (<= |#NULL.base| 0) (< |~#array~0.base| |#StackHeapBarrier|) (= |#valid| (store (store |old(#valid)| 0 0) |~#array~0.base| 1)) (<= 0 |#NULL.base|) (= (store |old(#memory_int)| |~#array~0.base| (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1)) |#memory_int|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |~#array~0.offset|) (= |#length| (store |old(#length)| |~#array~0.base| 1048576)) (= |#NULL.offset| 0) (= 0 |~#array~0.offset|) (not (= 0 |~#array~0.base|))) [2019-10-13 23:00:09,392 INFO L193 IcfgInterpreter]: Reachable states at location L10-4 satisfy 245#(not (< (mod main_~i~0 4294967296) 1048576)) [2019-10-13 23:00:09,392 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:00:09,392 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 273#(and (= |old(~#array~0.base)| |~#array~0.base|) (= |~#array~0.offset| |old(~#array~0.offset)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|)) [2019-10-13 23:00:09,393 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 240#true [2019-10-13 23:00:09,393 INFO L193 IcfgInterpreter]: Reachable states at location L11-3 satisfy 199#(or (and (<= 0 main_~j~0) (<= 0 main_~i~0) (= 0 |#NULL.base|) (<= 1 main_~a~0) (< |~#array~0.base| |#StackHeapBarrier|) (= |main_#in~argv.base| main_~argv.base) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (< (mod main_~i~0 4294967296) 1048576) (<= main_~a~0 1) (<= 0 |~#array~0.offset|) (= main_~j~0 0) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.offset|) (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1)) (<= main_~j~0 0) (not (= 0 |~#array~0.base|)) (<= |~#array~0.offset| 0) (= 1048576 (select |#length| |~#array~0.base|)) (<= |#NULL.base| 0) (<= main_~i~0 0) (<= |#NULL.offset| 0) (= |main_#in~argc| main_~argc) (= |main_#in~argv.offset| main_~argv.offset) (= main_~a~0 1) (= 0 (select |#valid| 0)) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= main_~i~0 0)) (not (< (mod main_~k~0 4294967296) 1048576))) [2019-10-13 23:00:09,393 INFO L193 IcfgInterpreter]: Reachable states at location L12-3 satisfy 184#true [2019-10-13 23:00:09,394 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 269#true [2019-10-13 23:00:09,394 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 255#true [2019-10-13 23:00:09,834 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-10-13 23:00:09,863 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:00:09,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6, 7] total 19 [2019-10-13 23:00:09,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943189611] [2019-10-13 23:00:09,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 23:00:09,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:00:09,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 23:00:09,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:00:09,867 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 19 states. [2019-10-13 23:00:10,191 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-10-13 23:00:11,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:00:11,070 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2019-10-13 23:00:11,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-13 23:00:11,071 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 14 [2019-10-13 23:00:11,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:00:11,072 INFO L225 Difference]: With dead ends: 47 [2019-10-13 23:00:11,072 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 23:00:11,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=281, Invalid=1201, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 23:00:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 23:00:11,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-13 23:00:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 23:00:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-10-13 23:00:11,083 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 14 [2019-10-13 23:00:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:00:11,083 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-10-13 23:00:11,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 23:00:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-10-13 23:00:11,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 23:00:11,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:00:11,085 INFO L380 BasicCegarLoop]: trace histogram [12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:00:11,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:11,287 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:00:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:00:11,288 INFO L82 PathProgramCache]: Analyzing trace with hash 83697117, now seen corresponding path program 2 times [2019-10-13 23:00:11,288 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:00:11,288 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9664854] [2019-10-13 23:00:11,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:11,289 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:00:11,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:00:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:00:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 59 proven. 6 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-13 23:00:11,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9664854] [2019-10-13 23:00:11,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118469630] [2019-10-13 23:00:11,514 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:11,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-10-13 23:00:11,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:00:11,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:00:11,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:00:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-13 23:00:11,591 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:00:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-13 23:00:11,610 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 23:00:11,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 8 [2019-10-13 23:00:11,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15454353] [2019-10-13 23:00:11,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:00:11,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:00:11,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:00:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:00:11,616 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2019-10-13 23:00:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:00:11,628 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-10-13 23:00:11,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:00:11,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-10-13 23:00:11,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:00:11,630 INFO L225 Difference]: With dead ends: 37 [2019-10-13 23:00:11,630 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 23:00:11,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:00:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 23:00:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 23:00:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 23:00:11,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 23:00:11,635 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-10-13 23:00:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:00:11,635 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 23:00:11,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:00:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 23:00:11,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 23:00:11,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:00:11,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 23:00:12,095 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-10-13 23:00:12,221 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-10-13 23:00:12,301 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~#array~0.base)| |~#array~0.base|) (= |~#array~0.offset| |old(~#array~0.offset)|) (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#length)| |#length|)) [2019-10-13 23:00:12,301 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 23:00:12,301 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 23:00:12,302 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 1048576 (select |#length| |~#array~0.base|)) (<= |#NULL.base| 0) (< |~#array~0.base| |#StackHeapBarrier|) (= (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1) (select |#memory_int| |~#array~0.base|)) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 0 |~#array~0.offset|)) [2019-10-13 23:00:12,302 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 23:00:12,302 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 23:00:12,302 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 5 21) no Hoare annotation was computed. [2019-10-13 23:00:12,302 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 5 21) no Hoare annotation was computed. [2019-10-13 23:00:12,304 INFO L439 ceAbstractionStarter]: At program point L11-3(lines 11 13) the Hoare annotation is: (or (not (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1))) (not (= 0 |~#array~0.offset|)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 1 (select |#valid| |~#array~0.base|))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 1048576 (select |#length| |~#array~0.base|))) (not (< |~#array~0.base| |#StackHeapBarrier|)) (and (< (mod main_~i~0 4294967296) 1048576) (or (and (= |main_#in~argv.base| main_~argv.base) (= |main_#in~argc| main_~argc) (= |main_#in~argv.offset| main_~argv.offset) (= main_~j~0 0) (= |#memory_int| |old(#memory_int)|) (= main_~i~0 0)) (<= 1048576 (mod main_~k~0 4294967296))) (= main_~a~0 1))) [2019-10-13 23:00:12,304 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 5 21) the Hoare annotation is: (or (not (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1))) (not (= 0 |~#array~0.offset|)) (= |#memory_int| |old(#memory_int)|) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 1 (select |#valid| |~#array~0.base|))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 1048576 (select |#length| |~#array~0.base|))) (not (< |~#array~0.base| |#StackHeapBarrier|))) [2019-10-13 23:00:12,304 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2019-10-13 23:00:12,305 INFO L439 ceAbstractionStarter]: At program point L16(lines 6 21) the Hoare annotation is: (or (not (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1))) (not (= 0 |~#array~0.offset|)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 1 (select |#valid| |~#array~0.base|))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 1048576 (select |#length| |~#array~0.base|))) (not (< |~#array~0.base| |#StackHeapBarrier|))) [2019-10-13 23:00:12,305 INFO L439 ceAbstractionStarter]: At program point L12-3(lines 12 13) the Hoare annotation is: (or (not (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1))) (not (= 0 |~#array~0.offset|)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 1 (select |#valid| |~#array~0.base|))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 1048576 (select |#length| |~#array~0.base|))) (and (< (mod main_~i~0 4294967296) 1048576) (= main_~a~0 1)) (not (< |~#array~0.base| |#StackHeapBarrier|))) [2019-10-13 23:00:12,305 INFO L439 ceAbstractionStarter]: At program point L10-3(lines 10 13) the Hoare annotation is: (let ((.cse0 (= main_~a~0 1))) (or (not (= (select |old(#memory_int)| |~#array~0.base|) (store ((as const (Array Int Int)) 0) |~#array~0.offset| 1))) (not (= 0 |~#array~0.offset|)) (not (= |#NULL.offset| 0)) (not (<= 0 |#NULL.base|)) (not (= 1 (select |#valid| |~#array~0.base|))) (not (= 0 (select |#valid| 0))) (not (<= |#NULL.base| 0)) (not (= 1048576 (select |#length| |~#array~0.base|))) (and (<= 1048576 (mod main_~k~0 4294967296)) .cse0) (not (< |~#array~0.base| |#StackHeapBarrier|)) (and .cse0 (= |#memory_int| |old(#memory_int)|) (= main_~i~0 0)))) [2019-10-13 23:00:12,305 INFO L443 ceAbstractionStarter]: For program point L10-4(lines 6 21) no Hoare annotation was computed. [2019-10-13 23:00:12,310 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:312) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:157) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-13 23:00:12,320 INFO L168 Benchmark]: Toolchain (without parser) took 21952.81 ms. Allocated memory was 138.9 MB in the beginning and 461.4 MB in the end (delta: 322.4 MB). Free memory was 103.4 MB in the beginning and 99.0 MB in the end (delta: 4.4 MB). Peak memory consumption was 326.8 MB. Max. memory is 7.1 GB. [2019-10-13 23:00:12,321 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 23:00:12,324 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.75 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 103.2 MB in the beginning and 164.8 MB in the end (delta: -61.6 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. [2019-10-13 23:00:12,325 INFO L168 Benchmark]: Boogie Preprocessor took 42.51 ms. Allocated memory is still 202.9 MB. Free memory was 164.8 MB in the beginning and 162.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-13 23:00:12,330 INFO L168 Benchmark]: RCFGBuilder took 406.44 ms. Allocated memory is still 202.9 MB. Free memory was 162.3 MB in the beginning and 144.8 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. [2019-10-13 23:00:12,331 INFO L168 Benchmark]: TraceAbstraction took 21053.45 ms. Allocated memory was 202.9 MB in the beginning and 461.4 MB in the end (delta: 258.5 MB). Free memory was 144.1 MB in the beginning and 99.0 MB in the end (delta: 45.1 MB). Peak memory consumption was 303.6 MB. Max. memory is 7.1 GB. [2019-10-13 23:00:12,336 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.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 445.75 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 103.2 MB in the beginning and 164.8 MB in the end (delta: -61.6 MB). Peak memory consumption was 32.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.51 ms. Allocated memory is still 202.9 MB. Free memory was 164.8 MB in the beginning and 162.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 406.44 ms. Allocated memory is still 202.9 MB. Free memory was 162.3 MB in the beginning and 144.8 MB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21053.45 ms. Allocated memory was 202.9 MB in the beginning and 461.4 MB in the end (delta: 258.5 MB). Free memory was 144.1 MB in the beginning and 99.0 MB in the end (delta: 45.1 MB). Peak memory consumption was 303.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...