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_03.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:36:26,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:36:26,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:36:26,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:36:26,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:36:26,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:36:26,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:36:26,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:36:26,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:36:26,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:36:26,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:36:26,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:36:26,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:36:26,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:36:26,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:36:26,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:36:26,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:36:26,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:36:26,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:36:26,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:36:26,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:36:26,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:36:26,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:36:26,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:36:26,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:36:26,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:36:26,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:36:26,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:36:26,991 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:36:26,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:36:26,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:36:26,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:36:26,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:36:26,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:36:26,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:36:26,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:36:26,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:36:27,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:36:27,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:36:27,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:36:27,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:36:27,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:27,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:36:27,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:36:27,025 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:36:27,025 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:36:27,025 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:36:27,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:36:27,026 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:36:27,026 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:36:27,026 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:36:27,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:36:27,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:36:27,027 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:36:27,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:36:27,027 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:36:27,027 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:36:27,027 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:36:27,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:36:27,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:36:27,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:36:27,028 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:36:27,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:36:27,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:36:27,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:36:27,029 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:36:27,029 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:36:27,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:36:27,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:36:27,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:36:27,030 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:27,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:36:27,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:36:27,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:36:27,340 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:36:27,340 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:36:27,341 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_03.i [2019-10-13 21:36:27,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ada8bcec/1aec3b60f0704b3fa5c25140cbaa9a76/FLAG7a3f54273 [2019-10-13 21:36:27,904 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:36:27,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_03.i [2019-10-13 21:36:27,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ada8bcec/1aec3b60f0704b3fa5c25140cbaa9a76/FLAG7a3f54273 [2019-10-13 21:36:28,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ada8bcec/1aec3b60f0704b3fa5c25140cbaa9a76 [2019-10-13 21:36:28,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:36:28,282 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:36:28,283 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:28,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:36:28,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:36:28,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:28" (1/1) ... [2019-10-13 21:36:28,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cfc3857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:28, skipping insertion in model container [2019-10-13 21:36:28,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:36:28" (1/1) ... [2019-10-13 21:36:28,299 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:36:28,320 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:36:28,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:28,483 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:36:28,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:36:28,529 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:36:28,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:28 WrapperNode [2019-10-13 21:36:28,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:36:28,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:36:28,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:36:28,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:36:28,641 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:28" (1/1) ... [2019-10-13 21:36:28,642 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:28" (1/1) ... [2019-10-13 21:36:28,649 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:28" (1/1) ... [2019-10-13 21:36:28,649 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:28" (1/1) ... [2019-10-13 21:36:28,656 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:28" (1/1) ... [2019-10-13 21:36:28,663 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:28" (1/1) ... [2019-10-13 21:36:28,664 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:28" (1/1) ... [2019-10-13 21:36:28,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:36:28,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:36:28,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:36:28,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:36:28,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:36:28,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:36:28,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:36:28,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:36:28,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:36:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:36:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:36:28,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:36:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:36:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:36:28,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:36:28,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:36:28,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:36:28,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:36:28,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:36:28,999 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:36:29,000 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:36:29,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:29 BoogieIcfgContainer [2019-10-13 21:36:29,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:36:29,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:36:29,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:36:29,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:36:29,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:36:28" (1/3) ... [2019-10-13 21:36:29,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50343028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:29, skipping insertion in model container [2019-10-13 21:36:29,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:36:28" (2/3) ... [2019-10-13 21:36:29,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50343028 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:36:29, skipping insertion in model container [2019-10-13 21:36:29,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:36:29" (3/3) ... [2019-10-13 21:36:29,010 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_two_index_03.i [2019-10-13 21:36:29,031 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:36:29,058 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:36:29,091 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:36:29,130 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:36:29,130 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:36:29,130 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:36:29,130 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:36:29,131 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:36:29,131 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:36:29,131 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:36:29,131 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:36:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:36:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:36:29,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:29,159 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:29,161 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:29,167 INFO L82 PathProgramCache]: Analyzing trace with hash 328370140, now seen corresponding path program 1 times [2019-10-13 21:36:29,174 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:29,174 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621267728] [2019-10-13 21:36:29,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:29,175 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:29,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:29,359 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:29,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621267728] [2019-10-13 21:36:29,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:29,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:36:29,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178085865] [2019-10-13 21:36:29,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:36:29,367 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:29,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:36:29,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:36:29,389 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:36:29,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:29,450 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:36:29,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:36:29,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:36:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:29,461 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:36:29,461 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:36:29,464 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:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:36:29,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:36:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:36:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-13 21:36:29,498 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-13 21:36:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:29,498 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-13 21:36:29,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:36:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-13 21:36:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:36:29,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:29,500 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:29,500 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:29,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1896737256, now seen corresponding path program 1 times [2019-10-13 21:36:29,501 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:29,502 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460013760] [2019-10-13 21:36:29,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:29,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:29,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:29,563 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:29,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460013760] [2019-10-13 21:36:29,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:36:29,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:36:29,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11173810] [2019-10-13 21:36:29,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:36:29,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:29,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:36:29,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:36:29,567 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-13 21:36:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:29,611 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-13 21:36:29,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:36:29,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:36:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:29,615 INFO L225 Difference]: With dead ends: 30 [2019-10-13 21:36:29,615 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 21:36:29,616 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:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 21:36:29,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-10-13 21:36:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:36:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:36:29,628 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:36:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:29,628 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:36:29,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:36:29,629 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:36:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:36:29,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:29,630 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:29,630 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:29,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:29,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1718311367, now seen corresponding path program 1 times [2019-10-13 21:36:29,631 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:29,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812042724] [2019-10-13 21:36:29,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:29,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:29,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:29,712 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:29,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812042724] [2019-10-13 21:36:29,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917686005] [2019-10-13 21:36:29,713 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:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:29,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:36:29,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:29,831 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:29,831 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:29,866 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:29,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2035801018] [2019-10-13 21:36:29,892 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:29,892 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:29,898 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:29,906 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:29,907 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:30,067 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:30,528 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-10-13 21:36:30,664 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:30,689 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:30,699 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:30,699 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:30,699 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:30,700 INFO L193 IcfgInterpreter]: Reachable states at location L24-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:30,701 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:30,701 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:30,702 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:30,702 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:30,702 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (<= 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_~i~0 10000) (= |main_#t~mem3| (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 12) |main_~#b~0.offset| 4))) (<= main_~j~0 0)) [2019-10-13 21:36:30,702 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:30,703 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:30,703 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:30,703 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:30,703 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:30,703 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:31,036 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:31,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 18 [2019-10-13 21:36:31,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467741943] [2019-10-13 21:36:31,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 21:36:31,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:31,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 21:36:31,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:36:31,042 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 18 states. [2019-10-13 21:36:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:31,852 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2019-10-13 21:36:31,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 21:36:31,852 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2019-10-13 21:36:31,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:31,854 INFO L225 Difference]: With dead ends: 50 [2019-10-13 21:36:31,854 INFO L226 Difference]: Without dead ends: 39 [2019-10-13 21:36:31,857 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:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-13 21:36:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2019-10-13 21:36:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-13 21:36:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-13 21:36:31,871 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2019-10-13 21:36:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:31,871 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-13 21:36:31,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 21:36:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-13 21:36:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 21:36:31,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:31,873 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:32,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:32,086 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1363999975, now seen corresponding path program 2 times [2019-10-13 21:36:32,087 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:32,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583017617] [2019-10-13 21:36:32,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:32,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:32,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:32,186 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:32,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583017617] [2019-10-13 21:36:32,186 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271720604] [2019-10-13 21:36:32,187 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:32,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:36:32,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:32,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:36:32,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:32,265 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:32,268 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:32,310 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:32,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1025027480] [2019-10-13 21:36:32,312 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:32,312 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:32,312 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:32,313 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:32,313 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:32,368 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:32,737 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:32,755 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:32,762 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:32,762 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:32,762 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:32,762 INFO L193 IcfgInterpreter]: Reachable states at location L24-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:32,763 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:32,763 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:32,763 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:32,763 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:32,764 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (<= 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_~i~0 10000) (= |main_#t~mem3| (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 12) |main_~#b~0.offset| 4))) (<= main_~j~0 0)) [2019-10-13 21:36:32,764 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:32,764 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:32,764 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:32,765 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:32,765 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:32,765 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:33,034 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:33,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 11] total 21 [2019-10-13 21:36:33,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458144212] [2019-10-13 21:36:33,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 21:36:33,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:33,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 21:36:33,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:36:33,037 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2019-10-13 21:36:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:34,172 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2019-10-13 21:36:34,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-13 21:36:34,174 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-10-13 21:36:34,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:34,177 INFO L225 Difference]: With dead ends: 73 [2019-10-13 21:36:34,177 INFO L226 Difference]: Without dead ends: 60 [2019-10-13 21:36:34,181 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:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-13 21:36:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-10-13 21:36:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 21:36:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-13 21:36:34,204 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2019-10-13 21:36:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:34,204 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-13 21:36:34,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 21:36:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-13 21:36:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 21:36:34,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:34,206 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:34,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:34,415 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:34,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:34,416 INFO L82 PathProgramCache]: Analyzing trace with hash 311824988, now seen corresponding path program 3 times [2019-10-13 21:36:34,416 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:34,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645594598] [2019-10-13 21:36:34,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:34,417 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:34,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:34,573 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:34,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645594598] [2019-10-13 21:36:34,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440951650] [2019-10-13 21:36:34,574 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:34,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:36:34,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:36:34,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 21:36:34,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:34,752 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:34,752 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:34,933 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:34,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [169703422] [2019-10-13 21:36:34,936 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:34,936 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:34,937 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:34,938 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:34,938 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:34,998 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:35,319 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:35,335 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:35,341 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:35,341 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:35,342 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:35,343 INFO L193 IcfgInterpreter]: Reachable states at location L24-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:35,343 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:35,344 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:35,344 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:35,344 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:35,345 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (<= 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_~i~0 10000) (= |main_#t~mem3| (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 12) |main_~#b~0.offset| 4))) (<= main_~j~0 0)) [2019-10-13 21:36:35,345 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:35,345 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:35,345 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:35,346 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:35,346 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:35,350 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:35,678 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:35,679 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 37 [2019-10-13 21:36:35,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329470857] [2019-10-13 21:36:35,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-13 21:36:35,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:35,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-13 21:36:35,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=904, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 21:36:35,681 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 37 states. [2019-10-13 21:36:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:37,639 INFO L93 Difference]: Finished difference Result 112 states and 146 transitions. [2019-10-13 21:36:37,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-13 21:36:37,640 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 28 [2019-10-13 21:36:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:37,642 INFO L225 Difference]: With dead ends: 112 [2019-10-13 21:36:37,642 INFO L226 Difference]: Without dead ends: 94 [2019-10-13 21:36:37,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2061 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1702, Invalid=4778, Unknown=0, NotChecked=0, Total=6480 [2019-10-13 21:36:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-13 21:36:37,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 52. [2019-10-13 21:36:37,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 21:36:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-10-13 21:36:37,665 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 28 [2019-10-13 21:36:37,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:37,665 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-10-13 21:36:37,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-13 21:36:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-10-13 21:36:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 21:36:37,667 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:37,667 INFO L380 BasicCegarLoop]: trace histogram [24, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:37,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:37,872 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:37,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:37,873 INFO L82 PathProgramCache]: Analyzing trace with hash -19181412, now seen corresponding path program 4 times [2019-10-13 21:36:37,873 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:37,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558988654] [2019-10-13 21:36:37,873 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:37,874 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:37,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-13 21:36:38,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558988654] [2019-10-13 21:36:38,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548707362] [2019-10-13 21:36:38,121 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:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:38,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-13 21:36:38,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:36:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:36:38,383 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:36:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 21:36:38,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [975255963] [2019-10-13 21:36:38,946 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:36:38,946 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:36:38,947 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:36:38,947 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:36:38,947 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:36:38,969 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:36:39,230 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 32 for LOIs [2019-10-13 21:36:39,239 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:36:39,245 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:36:39,245 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:36:39,246 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:39,246 INFO L193 IcfgInterpreter]: Reachable states at location L24-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,260 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:39,261 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,261 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:39,261 INFO L193 IcfgInterpreter]: Reachable states at location L16-2 satisfy 111#(<= 1 main_~i~0) [2019-10-13 21:36:39,261 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 121#(and (<= 0 main_~j~0) (<= 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_~i~0 10000) (= |main_#t~mem3| (select (select |#memory_int| |main_~#b~0.base|) (+ (* main_~j~0 12) |main_~#b~0.offset| 4))) (<= main_~j~0 0)) [2019-10-13 21:36:39,262 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,262 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,262 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,262 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:36:39,262 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-13 21:36:39,263 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:39,601 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:36:39,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 27, 27, 11] total 68 [2019-10-13 21:36:39,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249215435] [2019-10-13 21:36:39,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-10-13 21:36:39,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:36:39,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-10-13 21:36:39,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1792, Invalid=2764, Unknown=0, NotChecked=0, Total=4556 [2019-10-13 21:36:39,607 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 68 states. [2019-10-13 21:36:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:36:44,191 INFO L93 Difference]: Finished difference Result 185 states and 249 transitions. [2019-10-13 21:36:44,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-10-13 21:36:44,191 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 48 [2019-10-13 21:36:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:36:44,194 INFO L225 Difference]: With dead ends: 185 [2019-10-13 21:36:44,195 INFO L226 Difference]: Without dead ends: 163 [2019-10-13 21:36:44,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7869 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6850, Invalid=16102, Unknown=0, NotChecked=0, Total=22952 [2019-10-13 21:36:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-13 21:36:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 93. [2019-10-13 21:36:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-13 21:36:44,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2019-10-13 21:36:44,223 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 48 [2019-10-13 21:36:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:36:44,223 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2019-10-13 21:36:44,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-10-13 21:36:44,224 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2019-10-13 21:36:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:36:44,227 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:36:44,227 INFO L380 BasicCegarLoop]: trace histogram [55, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:36:44,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:36:44,430 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:36:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:36:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1425033416, now seen corresponding path program 5 times [2019-10-13 21:36:44,431 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:36:44,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599826296] [2019-10-13 21:36:44,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:44,432 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:36:44,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:36:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:36:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1793 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-10-13 21:36:44,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599826296] [2019-10-13 21:36:44,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889322589] [2019-10-13 21:36:44,876 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