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_two_index_05.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:36:30,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:36:30,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:36:30,933 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:36:30,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:36:30,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:36:30,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:36:30,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:36:30,953 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:36:30,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:36:30,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:36:30,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:36:30,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:36:30,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:36:30,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:36:30,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:36:30,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:36:30,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:36:30,972 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:36:30,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:36:30,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:36:30,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:36:30,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:36:30,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:36:30,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:36:30,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:36:30,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:36:30,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:36:30,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:36:30,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:36:30,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:36:30,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:36:30,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:36:30,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:36:30,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:36:30,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:36:31,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:36:31,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:36:31,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:36:31,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:36:31,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:36:31,003 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:36:31,018 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:36:31,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:36:31,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:36:31,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:36:31,020 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:36:31,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:36:31,020 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:36:31,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:36:31,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:36:31,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:36:31,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:36:31,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:36:31,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:36:31,022 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:36:31,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:36:31,022 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:36:31,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:36:31,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:36:31,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:36:31,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:36:31,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:36:31,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:36:31,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:36:31,024 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:36:31,024 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:36:31,024 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:36:31,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:36:31,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:36:31,025 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:36:31,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:36:31,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:36:31,312 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:36:31,314 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:36:31,314 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:36:31,315 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_05.i [2019-10-13 21:36:31,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0b76df9/ed8475a66bc84274b95fa9766cd127ba/FLAG986c37a63 [2019-10-13 21:36:31,822 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:36:31,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_05.i [2019-10-13 21:36:31,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0b76df9/ed8475a66bc84274b95fa9766cd127ba/FLAG986c37a63 [2019-10-13 21:36:32,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0b76df9/ed8475a66bc84274b95fa9766cd127ba [2019-10-13 21:36:32,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:36:32,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:36:32,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:32,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:36:32,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:36:32,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:32" (1/1) ... [2019-10-13 21:36:32,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e9690e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:32, skipping insertion in model container [2019-10-13 21:36:32,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:32" (1/1) ... [2019-10-13 21:36:32,222 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:36:32,240 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:36:32,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:32,460 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:36:32,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:32,507 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:36:32,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:32 WrapperNode [2019-10-13 21:36:32,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:32,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:36:32,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:36:32,508 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:36:32,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:32" (1/1) ... [2019-10-13 21:36:32,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:32" (1/1) ... [2019-10-13 21:36:32,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:32" (1/1) ... [2019-10-13 21:36:32,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:32" (1/1) ... [2019-10-13 21:36:32,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:32" (1/1) ... [2019-10-13 21:36:32,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:32" (1/1) ... [2019-10-13 21:36:32,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:32" (1/1) ... [2019-10-13 21:36:32,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:36:32,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:36:32,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:36:32,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:36:32,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:32" (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:36:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:36:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:36:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:36:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:36:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:36:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:36:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:36:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:36:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:36:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:36:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:36:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:36:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:36:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:36:33,003 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:36:33,003 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:36:33,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:33 BoogieIcfgContainer [2019-10-13 21:36:33,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:36:33,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:36:33,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:36:33,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:36:33,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:36:32" (1/3) ... [2019-10-13 21:36:33,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ef8298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:33, skipping insertion in model container [2019-10-13 21:36:33,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:32" (2/3) ... [2019-10-13 21:36:33,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ef8298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:33, skipping insertion in model container [2019-10-13 21:36:33,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:33" (3/3) ... [2019-10-13 21:36:33,013 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_05.i [2019-10-13 21:36:33,026 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:36:33,033 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:36:33,050 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:36:33,081 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:36:33,081 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:36:33,081 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:36:33,081 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:36:33,081 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:36:33,082 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:36:33,082 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:36:33,082 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:36:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:36:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:36:33,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:33,107 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:33,109 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:33,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:33,115 INFO L82 PathProgramCache]: Analyzing trace with hash 328370140, now seen corresponding path program 1 times [2019-10-13 21:36:33,122 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:33,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096763642] [2019-10-13 21:36:33,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:33,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:33,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:33,319 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:36:33,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096763642] [2019-10-13 21:36:33,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:33,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:36:33,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111206829] [2019-10-13 21:36:33,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:36:33,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:33,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:36:33,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:36:33,347 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:36:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:33,405 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:36:33,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:36:33,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:36:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:33,417 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:36:33,417 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:36:33,421 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:36:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:36:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:36:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:36:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-13 21:36:33,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-13 21:36:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:33,465 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-13 21:36:33,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:36:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-13 21:36:33,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:36:33,466 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:33,466 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:33,467 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:33,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1896737256, now seen corresponding path program 1 times [2019-10-13 21:36:33,468 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:33,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461929406] [2019-10-13 21:36:33,468 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:33,469 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:33,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:33,520 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:36:33,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461929406] [2019-10-13 21:36:33,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:33,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:36:33,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061175515] [2019-10-13 21:36:33,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:36:33,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:33,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:36:33,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:36:33,525 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-13 21:36:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:33,559 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-13 21:36:33,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:36:33,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:36:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:33,562 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:36:33,563 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:36:33,564 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:36:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:36:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-10-13 21:36:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:36:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:36:33,580 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:36:33,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:33,581 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:36:33,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:36:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:36:33,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:36:33,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:33,583 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:33,583 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:33,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:33,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1718311367, now seen corresponding path program 1 times [2019-10-13 21:36:33,584 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:33,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221959353] [2019-10-13 21:36:33,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:33,585 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:33,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:33,694 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:36:33,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221959353] [2019-10-13 21:36:33,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476084504] [2019-10-13 21:36:33,697 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:36:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:33,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:36:33,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:33,816 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:36:33,817 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:33,854 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:36:33,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [983528341] [2019-10-13 21:36:33,883 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:33,884 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:33,891 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:33,900 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:33,901 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:34,085 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:34,537 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-13 21:36:34,689 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:34,705 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:34,713 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:34,713 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:34,714 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:34,714 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __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:36:34,714 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:34,715 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:34,715 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) (<= __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:36:34,715 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:34,716 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:36:34,716 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:36:34,717 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 20) |main_~#b~0.offset| 4))) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:34,717 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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:36:34,717 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:34,717 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:34,718 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.offset_BEFORE_CALL_1| Int) (v_prenex_1 Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) (+ |v_main_~#b~0.offset_BEFORE_CALL_1| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) |v_main_~#a~0.offset_BEFORE_CALL_1|))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| v_prenex_1) (+ v_prenex_2 4)) (select (select |#memory_int| v_prenex_4) v_prenex_3)))))) [2019-10-13 21:36:35,053 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:35,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:36:35,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718867181] [2019-10-13 21:36:35,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:36:35,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:35,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:36:35,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:36:35,057 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-13 21:36:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:35,880 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-10-13 21:36:35,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 21:36:35,880 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-13 21:36:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:35,882 INFO L225 Difference]: With dead ends: 50 [2019-10-13 21:36:35,882 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 21:36:35,884 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=234, Invalid=888, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 21:36:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 21:36:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2019-10-13 21:36:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:36:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-13 21:36:35,899 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-13 21:36:35,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:35,900 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-13 21:36:35,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:36:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-13 21:36:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:36:35,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:35,902 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:36,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:36,106 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:36,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1363999975, now seen corresponding path program 2 times [2019-10-13 21:36:36,107 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:36,108 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530357075] [2019-10-13 21:36:36,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:36,108 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:36,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:36:36,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530357075] [2019-10-13 21:36:36,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075787664] [2019-10-13 21:36:36,241 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 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:36:36,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:36:36,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:36,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:36:36,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:36:36,328 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:36:36,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [392297565] [2019-10-13 21:36:36,380 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:36,380 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:36,381 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:36,381 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:36,382 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:36,422 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:36,726 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:36,737 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:36,743 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:36,743 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:36,743 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (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_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:36,744 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (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_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:36,744 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:36,744 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:36,744 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (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_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:36,745 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:36,745 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:36:36,745 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:36:36,745 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 20) |main_~#b~0.offset| 4))) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:36,746 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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:36:36,746 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:36,746 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:36,746 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_6 Int) (v_prenex_7 Int) (|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_prenex_5 Int) (|v_main_~#a~0.offset_BEFORE_CALL_2| Int) (|v_main_~#b~0.offset_BEFORE_CALL_2| Int) (v_prenex_8 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 0) (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_~#b~0.base_BEFORE_CALL_2|) (+ |v_main_~#b~0.offset_BEFORE_CALL_2| 4))))) (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_5) v_prenex_7) (select (select |#memory_int| v_prenex_6) (+ v_prenex_8 4)))))) [2019-10-13 21:36:37,034 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:37,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 11] total 21 [2019-10-13 21:36:37,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363050842] [2019-10-13 21:36:37,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:36:37,038 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:37,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:36:37,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:36:37,039 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2019-10-13 21:36:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:38,058 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2019-10-13 21:36:38,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:36:38,058 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-10-13 21:36:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:38,060 INFO L225 Difference]: With dead ends: 73 [2019-10-13 21:36:38,060 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 21:36:38,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1456, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 21:36:38,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 21:36:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-10-13 21:36:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:36:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-13 21:36:38,072 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-10-13 21:36:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:38,072 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-13 21:36:38,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:36:38,073 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-13 21:36:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:36:38,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:38,074 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:38,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:38,278 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:38,279 INFO L82 PathProgramCache]: Analyzing trace with hash 311824988, now seen corresponding path program 3 times [2019-10-13 21:36:38,279 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:38,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315128232] [2019-10-13 21:36:38,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:38,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:38,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:38,472 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:36:38,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315128232] [2019-10-13 21:36:38,473 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943296461] [2019-10-13 21:36:38,473 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 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:36:38,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:36:38,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:38,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:36:38,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:38,634 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:36:38,634 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:38,780 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:36:38,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [685053290] [2019-10-13 21:36:38,782 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:38,782 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:38,782 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:38,782 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:38,783 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:38,830 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:39,208 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-13 21:36:39,306 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:39,329 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:39,335 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:39,335 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:39,335 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:39,336 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 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:36:39,336 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:39,336 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:39,336 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) (<= 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:36:39,337 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:39,337 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:36:39,337 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:36:39,337 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 20) |main_~#b~0.offset| 4))) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:39,338 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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:36:39,341 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:39,342 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:39,342 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (v_prenex_12 Int) (v_prenex_11 Int) (|v_main_~#b~0.offset_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (v_prenex_10 Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_12) (+ v_prenex_10 4)) (select (select |#memory_int| v_prenex_9) v_prenex_11))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) (+ |v_main_~#b~0.offset_BEFORE_CALL_3| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|)))))) [2019-10-13 21:36:39,728 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:39,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 38 [2019-10-13 21:36:39,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752149708] [2019-10-13 21:36:39,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-13 21:36:39,731 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:39,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-13 21:36:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=949, Unknown=0, NotChecked=0, Total=1406 [2019-10-13 21:36:39,735 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 38 states. [2019-10-13 21:36:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:41,816 INFO L93 Difference]: Finished difference Result 109 states and 142 transitions. [2019-10-13 21:36:41,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-13 21:36:41,816 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 28 [2019-10-13 21:36:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:41,819 INFO L225 Difference]: With dead ends: 109 [2019-10-13 21:36:41,819 INFO L226 Difference]: Without dead ends: 91 [2019-10-13 21:36:41,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1756, Invalid=4886, Unknown=0, NotChecked=0, Total=6642 [2019-10-13 21:36:41,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-13 21:36:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 52. [2019-10-13 21:36:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 21:36:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-10-13 21:36:41,853 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 28 [2019-10-13 21:36:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:41,854 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-10-13 21:36:41,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-13 21:36:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-10-13 21:36:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 21:36:41,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:41,855 INFO L380 BasicCegarLoop]: trace histogram [25, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:42,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:42,060 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:42,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:42,061 INFO L82 PathProgramCache]: Analyzing trace with hash 102164889, now seen corresponding path program 4 times [2019-10-13 21:36:42,062 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:42,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417629640] [2019-10-13 21:36:42,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:42,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:42,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-13 21:36:42,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417629640] [2019-10-13 21:36:42,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735797035] [2019-10-13 21:36:42,267 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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:36:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:42,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-13 21:36:42,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-13 21:36:42,558 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-13 21:36:43,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [702470104] [2019-10-13 21:36:43,287 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:43,287 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:43,288 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:43,288 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:43,288 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:43,312 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:43,617 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:43,628 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:43,633 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:43,634 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:43,634 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:43,634 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_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:36:43,635 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:43,635 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:43,635 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_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:36:43,636 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:43,636 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:36:43,636 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:36:43,638 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 20) |main_~#b~0.offset| 4))) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:43,638 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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:36:43,638 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:43,638 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:43,639 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((v_prenex_16 Int) (|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_4| Int) (|v_main_~#b~0.offset_BEFORE_CALL_4| Int) (v_prenex_14 Int) (v_prenex_13 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_16) (+ v_prenex_15 4)) (select (select |#memory_int| v_prenex_13) v_prenex_14))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|) (+ |v_main_~#b~0.offset_BEFORE_CALL_4| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|) |v_main_~#a~0.offset_BEFORE_CALL_4|)))))) [2019-10-13 21:36:44,038 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:44,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28, 28, 11] total 72 [2019-10-13 21:36:44,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158153333] [2019-10-13 21:36:44,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-13 21:36:44,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:44,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-13 21:36:44,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2038, Invalid=3074, Unknown=0, NotChecked=0, Total=5112 [2019-10-13 21:36:44,051 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 72 states. [2019-10-13 21:36:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:48,796 INFO L93 Difference]: Finished difference Result 172 states and 232 transitions. [2019-10-13 21:36:48,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-13 21:36:48,796 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 48 [2019-10-13 21:36:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:48,798 INFO L225 Difference]: With dead ends: 172 [2019-10-13 21:36:48,798 INFO L226 Difference]: Without dead ends: 151 [2019-10-13 21:36:48,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8624 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7326, Invalid=16854, Unknown=0, NotChecked=0, Total=24180 [2019-10-13 21:36:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-13 21:36:48,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 93. [2019-10-13 21:36:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-13 21:36:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2019-10-13 21:36:48,849 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 48 [2019-10-13 21:36:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:48,849 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2019-10-13 21:36:48,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-13 21:36:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2019-10-13 21:36:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:36:48,853 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:48,853 INFO L380 BasicCegarLoop]: trace histogram [59, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:49,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:49,064 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:49,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1137625480, now seen corresponding path program 5 times [2019-10-13 21:36:49,065 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:49,065 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976265891] [2019-10-13 21:36:49,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:49,065 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:49,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-10-13 21:36:49,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976265891] [2019-10-13 21:36:49,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582139524] [2019-10-13 21:36:49,513 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:58,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-10-13 21:36:58,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:58,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-13 21:36:58,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-10-13 21:36:58,905 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1941 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-10-13 21:36:59,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1132028861] [2019-10-13 21:36:59,420 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:59,421 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:59,421 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:59,421 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:59,422 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:59,446 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:59,735 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:59,742 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:59,745 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:59,745 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:59,745 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:59,745 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:59,746 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:59,746 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:36:59,746 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:36:59,746 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:59,747 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:36:59,747 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 |#NULL.offset|) (<= |#NULL.offset| 0) (= 0 (select |old(#valid)| 0))) [2019-10-13 21:36:59,747 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 20) |main_~#b~0.offset| 4))) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:36:59,747 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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:36:59,748 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:59,748 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:59,748 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_18 Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#b~0.offset_BEFORE_CALL_5| Int) (v_prenex_17 Int) (v_prenex_20 Int) (v_prenex_19 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|) (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|) (+ |v_main_~#b~0.offset_BEFORE_CALL_5| 4)))) (and (not (= (select (select |#memory_int| v_prenex_17) v_prenex_18) (select (select |#memory_int| v_prenex_20) (+ v_prenex_19 4)))) (= |__VERIFIER_assert_#in~cond| 0)))) [2019-10-13 21:37:00,102 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:00,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21, 11] total 51 [2019-10-13 21:37:00,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139570983] [2019-10-13 21:37:00,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-13 21:37:00,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:00,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-13 21:37:00,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=928, Invalid=1622, Unknown=0, NotChecked=0, Total=2550 [2019-10-13 21:37:00,105 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 51 states. [2019-10-13 21:37:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:37:05,583 INFO L93 Difference]: Finished difference Result 240 states and 298 transitions. [2019-10-13 21:37:05,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-10-13 21:37:05,583 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 89 [2019-10-13 21:37:05,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:37:05,587 INFO L225 Difference]: With dead ends: 240 [2019-10-13 21:37:05,587 INFO L226 Difference]: Without dead ends: 231 [2019-10-13 21:37:05,592 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4847 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5146, Invalid=12676, Unknown=0, NotChecked=0, Total=17822 [2019-10-13 21:37:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-10-13 21:37:05,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 113. [2019-10-13 21:37:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-13 21:37:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2019-10-13 21:37:05,623 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 89 [2019-10-13 21:37:05,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:37:05,624 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2019-10-13 21:37:05,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-13 21:37:05,624 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2019-10-13 21:37:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 21:37:05,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:37:05,627 INFO L380 BasicCegarLoop]: trace histogram [59, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:37:05,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:05,837 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:37:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:37:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash 854243016, now seen corresponding path program 6 times [2019-10-13 21:37:05,838 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:37:05,838 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98000162] [2019-10-13 21:37:05,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:05,838 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:37:05,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:37:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:37:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-10-13 21:37:06,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98000162] [2019-10-13 21:37:06,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605780375] [2019-10-13 21:37:06,862 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:37:07,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:37:07,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:37:07,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-13 21:37:07,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:37:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-13 21:37:07,610 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:37:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2511 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-10-13 21:37:11,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1351524069] [2019-10-13 21:37:11,133 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:37:11,133 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:37:11,134 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:37:11,134 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:37:11,134 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:37:11,161 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:37:11,399 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:37:11,406 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:37:11,409 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:37:11,410 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:37:11,410 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 131#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 21:37:11,410 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 136#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __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:37:11,410 INFO L193 IcfgInterpreter]: Reachable states at location L25-2 satisfy 116#(and (<= 0 main_~j~0) (<= 1 main_~i~0) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:37:11,411 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 145#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:37:11,411 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 141#(and (exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) (<= __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:37:11,411 INFO L193 IcfgInterpreter]: Reachable states at location L17-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:37:11,411 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:37:11,412 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:37:11,412 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 121#(and (<= 0 main_~j~0) (= |main_#t~mem3| (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 20) |main_~#b~0.offset| 4))) (< main_~i~0 100000) (<= 1 main_~i~0) (= |main_#t~mem2| (select (select |#memory_int| |main_~#a~0.base|) (+ (* main_~j~0 4) |main_~#a~0.offset|))) (= main_~i~0 1) (<= main_~i~0 1) (= main_~j~0 0) (<= main_~j~0 0)) [2019-10-13 21:37:11,412 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 150#(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:37:11,412 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:37:11,412 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:37:11,413 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 126#(exists ((|v_main_~#a~0.offset_BEFORE_CALL_6| Int) (|v_main_~#b~0.offset_BEFORE_CALL_6| Int) (v_prenex_23 Int) (v_prenex_22 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (v_prenex_24 Int) (v_prenex_21 Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (or (and (= (select (select |#memory_int| v_prenex_24) (+ v_prenex_22 4)) (select (select |#memory_int| v_prenex_23) v_prenex_21)) (= |__VERIFIER_assert_#in~cond| 1)) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|) (+ |v_main_~#b~0.offset_BEFORE_CALL_6| 4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|) |v_main_~#a~0.offset_BEFORE_CALL_6|)))))) [2019-10-13 21:37:11,843 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:37:11,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 62, 62, 11] total 160 [2019-10-13 21:37:11,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458455552] [2019-10-13 21:37:11,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-10-13 21:37:11,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:37:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-10-13 21:37:11,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11498, Invalid=13942, Unknown=0, NotChecked=0, Total=25440 [2019-10-13 21:37:11,849 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 160 states.