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/array-examples/standard_allDiff2_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:49,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:49,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:49,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:49,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:49,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:49,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:49,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:49,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:49,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:49,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:49,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:49,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:49,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:49,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:49,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:49,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:49,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:49,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:49,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:49,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:49,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:49,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:49,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:49,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:49,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:49,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:49,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:49,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:49,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:49,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:49,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:49,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:49,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:49,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:49,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:49,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:49,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:49,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:49,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:49,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:49,212 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 21:32:49,248 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:49,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:49,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:49,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:49,250 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:49,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:49,251 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:49,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:49,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:49,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:49,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:49,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:49,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:49,252 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:49,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:49,254 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:49,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:49,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:49,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:49,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:49,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:49,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:49,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:49,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:49,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:49,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:49,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:49,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:49,257 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 21:32:49,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:49,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:49,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:49,566 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:49,566 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:49,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_allDiff2_ground.i [2019-10-13 21:32:49,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536519fea/7827985552c940e1a35de34c938de8ed/FLAG7db32c05f [2019-10-13 21:32:50,122 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:50,123 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_allDiff2_ground.i [2019-10-13 21:32:50,130 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536519fea/7827985552c940e1a35de34c938de8ed/FLAG7db32c05f [2019-10-13 21:32:50,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/536519fea/7827985552c940e1a35de34c938de8ed [2019-10-13 21:32:50,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:50,478 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:50,483 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:50,483 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:50,487 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:50,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:50" (1/1) ... [2019-10-13 21:32:50,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d066b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:50, skipping insertion in model container [2019-10-13 21:32:50,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:50" (1/1) ... [2019-10-13 21:32:50,501 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:50,521 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:50,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:50,725 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:50,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:50,765 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:50,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:50 WrapperNode [2019-10-13 21:32:50,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:50,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:50,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:50,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:50,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:50" (1/1) ... [2019-10-13 21:32:50,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:50" (1/1) ... [2019-10-13 21:32:50,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:50" (1/1) ... [2019-10-13 21:32:50,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:50" (1/1) ... [2019-10-13 21:32:50,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:50" (1/1) ... [2019-10-13 21:32:50,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:50" (1/1) ... [2019-10-13 21:32:50,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:50" (1/1) ... [2019-10-13 21:32:50,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:50,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:50,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:50,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:50,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32: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 21:32:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:50,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:50,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:50,953 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:50,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:51,418 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:51,418 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-10-13 21:32:51,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:51 BoogieIcfgContainer [2019-10-13 21:32:51,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:51,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:51,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:51,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:51,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:50" (1/3) ... [2019-10-13 21:32:51,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6436623d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:51, skipping insertion in model container [2019-10-13 21:32:51,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:50" (2/3) ... [2019-10-13 21:32:51,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6436623d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:51, skipping insertion in model container [2019-10-13 21:32:51,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:51" (3/3) ... [2019-10-13 21:32:51,426 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_allDiff2_ground.i [2019-10-13 21:32:51,434 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:51,442 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:51,453 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:51,477 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:51,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:51,478 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:51,478 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:51,479 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:51,479 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:51,479 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:51,479 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-13 21:32:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:32:51,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:51,501 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:51,502 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:51,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:51,508 INFO L82 PathProgramCache]: Analyzing trace with hash -145704838, now seen corresponding path program 1 times [2019-10-13 21:32:51,518 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:51,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753863471] [2019-10-13 21:32:51,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:51,660 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 21:32:51,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753863471] [2019-10-13 21:32:51,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:51,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:51,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979293208] [2019-10-13 21:32:51,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:51,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:51,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:51,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:51,689 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-13 21:32:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:51,734 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-10-13 21:32:51,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:51,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 21:32:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:51,745 INFO L225 Difference]: With dead ends: 41 [2019-10-13 21:32:51,745 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 21:32:51,748 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 21:32:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 21:32:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 21:32:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 21:32:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 21:32:51,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2019-10-13 21:32:51,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:51,785 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 21:32:51,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 21:32:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 21:32:51,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:51,786 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:51,787 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:51,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1022759404, now seen corresponding path program 1 times [2019-10-13 21:32:51,787 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:51,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109422650] [2019-10-13 21:32:51,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:51,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109422650] [2019-10-13 21:32:51,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:51,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:32:51,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543831054] [2019-10-13 21:32:51,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:32:51,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:32:51,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:32:51,869 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 4 states. [2019-10-13 21:32:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:51,920 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:32:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:32:51,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 21:32:51,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:51,922 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:32:51,922 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 21:32:51,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:32:51,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 21:32:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-13 21:32:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 21:32:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 21:32:51,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2019-10-13 21:32:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:51,931 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 21:32:51,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:32:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 21:32:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:32:51,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:51,933 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:51,933 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:51,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:51,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1659797787, now seen corresponding path program 1 times [2019-10-13 21:32:51,934 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:51,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294656272] [2019-10-13 21:32:51,934 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,935 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:51,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:52,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294656272] [2019-10-13 21:32:52,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755567640] [2019-10-13 21:32:52,094 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 21:32:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:52,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:52,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:52,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:52,230 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:52,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:52,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [327393661] [2019-10-13 21:32:52,306 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:32:52,306 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:52,313 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:52,322 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:52,322 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:52,518 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:52,804 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 1 for LOIs [2019-10-13 21:32:52,811 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:52,819 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:52,819 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:52,819 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 98#(and (or (and (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1)) (and (not (= main_~r~0 0)) (= main_~i~0 2) (= main_~j~0 0) (not (<= 0 main_~j~0)))) (and (<= 1 main_~i~0) (<= main_~i~0 1))) [2019-10-13 21:32:52,820 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 161#false [2019-10-13 21:32:52,820 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 152#false [2019-10-13 21:32:52,820 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 166#false [2019-10-13 21:32:52,820 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 175#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:52,821 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 147#false [2019-10-13 21:32:52,821 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 93#(and (not (= main_~r~0 0)) (<= 0 main_~j~0) (= (+ main_~i~0 (- 1)) main_~j~0) (< main_~i~0 100000) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (<= main_~j~0 0)) [2019-10-13 21:32:52,821 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,822 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,822 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 137#false [2019-10-13 21:32:52,822 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 180#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:52,822 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:52,823 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:32:52,823 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 156#false [2019-10-13 21:32:52,823 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 171#false [2019-10-13 21:32:52,823 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 106#(and (<= 1 main_~i~0) (<= main_~i~0 1) (<= main_~r~0 0) (<= 0 main_~r~0)) [2019-10-13 21:32:53,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 21:32:53,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 4, 4] total 16 [2019-10-13 21:32:53,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322871498] [2019-10-13 21:32:53,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:32:53,062 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:53,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:32:53,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:32:53,063 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2019-10-13 21:32:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:53,288 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-10-13 21:32:53,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:32:53,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-10-13 21:32:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:53,290 INFO L225 Difference]: With dead ends: 36 [2019-10-13 21:32:53,290 INFO L226 Difference]: Without dead ends: 23 [2019-10-13 21:32:53,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:32:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-13 21:32:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-10-13 21:32:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 21:32:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-13 21:32:53,309 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 17 [2019-10-13 21:32:53,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:53,310 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-13 21:32:53,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:32:53,310 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-13 21:32:53,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 21:32:53,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:53,313 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:53,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:53,519 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:53,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:53,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1224522591, now seen corresponding path program 1 times [2019-10-13 21:32:53,520 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:53,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879347879] [2019-10-13 21:32:53,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:53,521 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:53,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:53,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879347879] [2019-10-13 21:32:53,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159797553] [2019-10-13 21:32:53,604 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 21:32:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:53,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:53,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:53,682 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 21:32:53,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [286112672] [2019-10-13 21:32:53,724 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:32:53,725 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:53,726 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:53,726 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:53,726 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:53,766 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:54,106 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:32:54,116 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:54,121 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:54,122 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:54,122 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 199#(<= 1 main_~i~0) [2019-10-13 21:32:54,122 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 295#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:54,123 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 286#(and (not (= main_~r~0 0)) (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:54,123 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 300#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:54,123 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 309#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:54,123 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 281#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-13 21:32:54,124 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 191#(<= 1 main_~i~0) [2019-10-13 21:32:54,124 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:54,124 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:54,124 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 271#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (< main_~y~0 100000) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-13 21:32:54,124 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 314#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:54,125 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:54,125 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:32:54,125 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 290#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))))))) [2019-10-13 21:32:54,126 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 305#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (v_prenex_1 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_1) v_prenex_2) (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) |v_main_~#a~0.offset_BEFORE_CALL_2|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (+ |v_main_~#a~0.offset_BEFORE_CALL_2| 4))))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:32:54,126 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 208#(<= 1 main_~i~0) [2019-10-13 21:32:58,194 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-13 21:32:58,548 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:58,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4, 12] total 21 [2019-10-13 21:32:58,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794670404] [2019-10-13 21:32:58,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:32:58,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:32:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:32:58,552 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 21 states. [2019-10-13 21:33:01,728 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-13 21:33:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:01,881 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2019-10-13 21:33:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-13 21:33:01,882 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 18 [2019-10-13 21:33:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:01,891 INFO L225 Difference]: With dead ends: 70 [2019-10-13 21:33:01,891 INFO L226 Difference]: Without dead ends: 48 [2019-10-13 21:33:01,896 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=372, Invalid=1980, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 21:33:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-13 21:33:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2019-10-13 21:33:01,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 21:33:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-10-13 21:33:01,923 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 18 [2019-10-13 21:33:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:01,923 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-10-13 21:33:01,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:33:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-10-13 21:33:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 21:33:01,926 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:01,926 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:02,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:02,134 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:02,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:02,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1005552771, now seen corresponding path program 2 times [2019-10-13 21:33:02,135 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:02,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377787487] [2019-10-13 21:33:02,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:02,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:02,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:33:02,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377787487] [2019-10-13 21:33:02,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468490938] [2019-10-13 21:33:02,271 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 21:33:02,356 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:33:02,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:02,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:33:02,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-13 21:33:02,404 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-13 21:33:02,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [43047134] [2019-10-13 21:33:02,464 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:02,464 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:02,465 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:02,465 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:02,465 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:02,518 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:02,759 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:33:02,768 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:02,771 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:02,771 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:02,772 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 199#(<= 1 main_~i~0) [2019-10-13 21:33:02,772 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 295#(and (exists ((v_prenex_4 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4))))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:02,772 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 286#(and (not (= main_~r~0 0)) (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:02,772 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 300#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4))))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:02,773 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 309#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:02,773 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 281#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-13 21:33:02,774 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 191#(<= 1 main_~i~0) [2019-10-13 21:33:02,774 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:02,774 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:02,774 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 271#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (< main_~y~0 100000) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-13 21:33:02,775 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 314#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:02,775 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:02,775 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:33:02,776 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 290#(exists ((v_prenex_4 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4))))))) [2019-10-13 21:33:02,776 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 305#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_4 Int) (|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_3 Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_3) v_prenex_4) (select (select |#memory_int| v_prenex_3) (+ v_prenex_4 4)))) (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (+ |v_main_~#a~0.offset_BEFORE_CALL_3| 4))))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:02,776 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 208#(<= 1 main_~i~0) [2019-10-13 21:33:06,817 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-13 21:33:07,130 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:07,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 12] total 28 [2019-10-13 21:33:07,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851510789] [2019-10-13 21:33:07,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 21:33:07,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:07,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 21:33:07,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:33:07,133 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 28 states. [2019-10-13 21:33:12,043 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 50 [2019-10-13 21:33:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:33:12,171 INFO L93 Difference]: Finished difference Result 136 states and 194 transitions. [2019-10-13 21:33:12,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-10-13 21:33:12,172 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2019-10-13 21:33:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:33:12,175 INFO L225 Difference]: With dead ends: 136 [2019-10-13 21:33:12,175 INFO L226 Difference]: Without dead ends: 104 [2019-10-13 21:33:12,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3657 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1852, Invalid=8248, Unknown=0, NotChecked=0, Total=10100 [2019-10-13 21:33:12,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-13 21:33:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 71. [2019-10-13 21:33:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-13 21:33:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2019-10-13 21:33:12,197 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 29 [2019-10-13 21:33:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:33:12,198 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2019-10-13 21:33:12,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 21:33:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2019-10-13 21:33:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 21:33:12,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:33:12,200 INFO L380 BasicCegarLoop]: trace histogram [23, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:33:12,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:12,404 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:33:12,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:33:12,405 INFO L82 PathProgramCache]: Analyzing trace with hash -534110383, now seen corresponding path program 3 times [2019-10-13 21:33:12,405 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:33:12,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700291183] [2019-10-13 21:33:12,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:12,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:33:12,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:33:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:33:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 167 proven. 349 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-13 21:33:12,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700291183] [2019-10-13 21:33:12,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159895382] [2019-10-13 21:33:12,742 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:33:12,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:33:12,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:12,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:33:12,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-13 21:33:13,054 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-13 21:33:13,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1056555965] [2019-10-13 21:33:13,362 INFO L162 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-10-13 21:33:13,362 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:13,362 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:13,362 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:13,363 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:13,382 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:13,564 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 26 for LOIs [2019-10-13 21:33:13,572 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:13,575 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:13,575 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:13,576 INFO L193 IcfgInterpreter]: Reachable states at location L14-3 satisfy 199#(<= 1 main_~i~0) [2019-10-13 21:33:13,578 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 295#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_6 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:13,578 INFO L193 IcfgInterpreter]: Reachable states at location L25-3 satisfy 286#(and (not (= main_~r~0 0)) (<= 1 main_~i~0) (= main_~x~0 0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:13,578 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 300#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_6 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:13,579 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 309#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:13,579 INFO L193 IcfgInterpreter]: Reachable states at location L26-3 satisfy 281#(and (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-13 21:33:13,579 INFO L193 IcfgInterpreter]: Reachable states at location L16-3 satisfy 191#(<= 1 main_~i~0) [2019-10-13 21:33:13,579 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:13,579 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:13,580 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 271#(and (= (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~y~0 4) |main_~#a~0.offset|)) |main_#t~mem9|) (not (= main_~r~0 0)) (< main_~x~0 100000) (<= 1 main_~i~0) (< main_~y~0 100000) (<= 1 main_~y~0) (= (+ main_~x~0 1) main_~y~0) (= main_~x~0 0) (= |main_#t~mem8| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~x~0 4) |main_~#a~0.offset|))) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) [2019-10-13 21:33:13,580 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 314#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:13,580 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:13,580 INFO L193 IcfgInterpreter]: Reachable states at location L10-3 satisfy 68#true [2019-10-13 21:33:13,580 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 290#(exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_6 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4)))))) [2019-10-13 21:33:13,581 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 305#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_6 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (v_prenex_5 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (not (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) (+ |v_main_~#a~0.offset_BEFORE_CALL_4| 4))))) (and (= |__VERIFIER_assert_#in~cond| 0) (= (select (select |#memory_int| v_prenex_5) v_prenex_6) (select (select |#memory_int| v_prenex_5) (+ v_prenex_6 4)))))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:33:13,581 INFO L193 IcfgInterpreter]: Reachable states at location L14-4 satisfy 208#(<= 1 main_~i~0) [2019-10-13 21:33:17,649 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-10-13 21:33:18,093 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:18,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 13, 13, 12] total 56 [2019-10-13 21:33:18,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594275037] [2019-10-13 21:33:18,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-13 21:33:18,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:18,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-13 21:33:18,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=2713, Unknown=0, NotChecked=0, Total=3080 [2019-10-13 21:33:18,097 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand 56 states.