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/sanfoundry_27_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:32:38,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:32:38,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:32:38,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:32:38,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:32:38,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:32:38,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:32:38,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:32:38,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:32:38,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:32:38,930 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:32:38,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:32:38,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:32:38,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:32:38,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:32:38,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:32:38,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:32:38,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:32:38,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:32:38,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:32:38,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:32:38,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:32:38,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:32:38,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:32:38,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:32:38,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:32:38,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:32:38,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:32:38,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:32:38,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:32:38,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:32:38,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:32:38,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:32:38,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:32:38,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:32:38,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:32:38,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:32:38,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:32:38,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:32:38,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:32:38,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:32:38,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:32:38,998 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:32:38,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:32:39,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:32:39,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:32:39,000 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:32:39,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:32:39,001 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:32:39,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:32:39,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:32:39,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:32:39,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:32:39,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:32:39,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:32:39,003 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:32:39,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:32:39,004 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:32:39,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:32:39,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:32:39,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:32:39,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:32:39,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:32:39,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:39,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:32:39,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:32:39,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:32:39,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:32:39,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:32:39,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:32:39,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 21:32:39,285 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:32:39,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:32:39,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:32:39,303 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:32:39,303 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:32:39,304 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_27_ground.i [2019-10-13 21:32:39,368 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993ef8b66/d9d28a25f9c0469f9377119d90539741/FLAG8608cc83d [2019-10-13 21:32:39,844 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:32:39,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_27_ground.i [2019-10-13 21:32:39,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993ef8b66/d9d28a25f9c0469f9377119d90539741/FLAG8608cc83d [2019-10-13 21:32:40,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993ef8b66/d9d28a25f9c0469f9377119d90539741 [2019-10-13 21:32:40,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:32:40,249 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:32:40,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:40,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:32:40,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:32:40,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:40" (1/1) ... [2019-10-13 21:32:40,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3304fef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:40, skipping insertion in model container [2019-10-13 21:32:40,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:32:40" (1/1) ... [2019-10-13 21:32:40,265 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:32:40,283 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:32:40,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:40,484 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:32:40,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:32:40,524 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:32:40,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:40 WrapperNode [2019-10-13 21:32:40,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:32:40,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:32:40,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:32:40,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:32:40,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:40" (1/1) ... [2019-10-13 21:32:40,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:40" (1/1) ... [2019-10-13 21:32:40,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:40" (1/1) ... [2019-10-13 21:32:40,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:40" (1/1) ... [2019-10-13 21:32:40,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:40" (1/1) ... [2019-10-13 21:32:40,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:40" (1/1) ... [2019-10-13 21:32:40,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:40" (1/1) ... [2019-10-13 21:32:40,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:32:40,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:32:40,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:32:40,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:32:40,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:32:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:32:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:32:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 21:32:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:32:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:32:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:32:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:32:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:32:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:32:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:32:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:32:40,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:32:40,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:32:40,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:32:41,107 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:32:41,108 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 21:32:41,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:41 BoogieIcfgContainer [2019-10-13 21:32:41,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:32:41,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:32:41,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:32:41,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:32:41,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:32:40" (1/3) ... [2019-10-13 21:32:41,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e13c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:41, skipping insertion in model container [2019-10-13 21:32:41,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:32:40" (2/3) ... [2019-10-13 21:32:41,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e13c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:32:41, skipping insertion in model container [2019-10-13 21:32:41,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:32:41" (3/3) ... [2019-10-13 21:32:41,117 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_27_ground.i [2019-10-13 21:32:41,127 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:32:41,138 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:32:41,149 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:32:41,174 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:32:41,174 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:32:41,174 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:32:41,174 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:32:41,174 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:32:41,174 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:32:41,174 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:32:41,175 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:32:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-13 21:32:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:32:41,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:41,196 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:41,198 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:41,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:41,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1947700096, now seen corresponding path program 1 times [2019-10-13 21:32:41,211 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:41,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316101021] [2019-10-13 21:32:41,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:41,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:41,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:32:41,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316101021] [2019-10-13 21:32:41,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:41,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:41,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286107487] [2019-10-13 21:32:41,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:41,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:41,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:41,403 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-10-13 21:32:41,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:41,456 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-10-13 21:32:41,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:41,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 21:32:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:41,469 INFO L225 Difference]: With dead ends: 33 [2019-10-13 21:32:41,469 INFO L226 Difference]: Without dead ends: 17 [2019-10-13 21:32:41,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-13 21:32:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-13 21:32:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 21:32:41,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-10-13 21:32:41,509 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2019-10-13 21:32:41,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:41,510 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-10-13 21:32:41,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-10-13 21:32:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:32:41,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:41,511 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:41,512 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:41,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:41,512 INFO L82 PathProgramCache]: Analyzing trace with hash 520805519, now seen corresponding path program 1 times [2019-10-13 21:32:41,513 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:41,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957042030] [2019-10-13 21:32:41,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:41,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:41,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:41,556 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957042030] [2019-10-13 21:32:41,556 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:32:41,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:32:41,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044920892] [2019-10-13 21:32:41,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:32:41,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:41,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:32:41,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:41,560 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2019-10-13 21:32:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:41,597 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2019-10-13 21:32:41,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:32:41,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 21:32:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:41,600 INFO L225 Difference]: With dead ends: 27 [2019-10-13 21:32:41,600 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:32:41,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:32:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:32:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:32:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:32:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-13 21:32:41,607 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-13 21:32:41,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:41,607 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-13 21:32:41,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:32:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-13 21:32:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 21:32:41,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:41,608 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:41,609 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:41,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1773270914, now seen corresponding path program 1 times [2019-10-13 21:32:41,610 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:41,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852750717] [2019-10-13 21:32:41,610 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:41,610 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:41,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:41,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852750717] [2019-10-13 21:32:41,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559729544] [2019-10-13 21:32:41,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:41,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:32:41,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:41,802 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 21:32:41,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1289032752] [2019-10-13 21:32:41,880 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:32:41,880 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:41,887 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:41,894 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:41,895 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:42,051 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:42,381 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:42,407 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:42,415 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:42,415 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:42,415 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:42,416 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:42,416 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~x~0 4) |main_~#array~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:42,417 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-13 21:32:42,417 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:42,417 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:42,417 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,418 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,418 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:42,418 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:32:42,418 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:42,419 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:42,419 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:42,758 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:42,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 21:32:42,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858609024] [2019-10-13 21:32:42,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-13 21:32:42,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:42,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-13 21:32:42,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:32:42,762 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 17 states. [2019-10-13 21:32:43,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:43,307 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2019-10-13 21:32:43,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 21:32:43,309 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-10-13 21:32:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:43,318 INFO L225 Difference]: With dead ends: 37 [2019-10-13 21:32:43,319 INFO L226 Difference]: Without dead ends: 26 [2019-10-13 21:32:43,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:32:43,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-13 21:32:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2019-10-13 21:32:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-13 21:32:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-13 21:32:43,344 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2019-10-13 21:32:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:43,345 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-13 21:32:43,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-13 21:32:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-13 21:32:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 21:32:43,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:43,347 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:43,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:43,558 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:43,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:43,559 INFO L82 PathProgramCache]: Analyzing trace with hash 503527757, now seen corresponding path program 2 times [2019-10-13 21:32:43,559 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:43,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387952612] [2019-10-13 21:32:43,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,560 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:43,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:43,671 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:32:43,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387952612] [2019-10-13 21:32:43,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432856314] [2019-10-13 21:32:43,672 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:32:43,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 21:32:43,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:43,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 21:32:43,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:32:43,761 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:32:43,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [618830810] [2019-10-13 21:32:43,895 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:32:43,896 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:43,896 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:43,896 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:43,897 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:43,945 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:44,119 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:44,150 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:44,165 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:44,165 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:44,166 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:44,166 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:44,167 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~x~0 4) |main_~#array~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:44,167 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-13 21:32:44,167 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:44,168 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:44,168 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,168 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,168 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:44,169 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:32:44,169 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:44,170 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:44,170 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:44,493 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:44,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 11] total 23 [2019-10-13 21:32:44,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329859070] [2019-10-13 21:32:44,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 21:32:44,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:44,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 21:32:44,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-10-13 21:32:44,498 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 23 states. [2019-10-13 21:32:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:45,193 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-10-13 21:32:45,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 21:32:45,194 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-10-13 21:32:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:45,195 INFO L225 Difference]: With dead ends: 51 [2019-10-13 21:32:45,195 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 21:32:45,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 21:32:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 21:32:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-10-13 21:32:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 21:32:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-10-13 21:32:45,206 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2019-10-13 21:32:45,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:45,206 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-10-13 21:32:45,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 21:32:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-10-13 21:32:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 21:32:45,207 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:45,208 INFO L380 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:45,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:45,411 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:45,412 INFO L82 PathProgramCache]: Analyzing trace with hash 677366477, now seen corresponding path program 3 times [2019-10-13 21:32:45,413 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:45,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363170530] [2019-10-13 21:32:45,413 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:45,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:45,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-13 21:32:45,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363170530] [2019-10-13 21:32:45,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296203417] [2019-10-13 21:32:45,606 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:32:45,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:32:45,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:32:45,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 21:32:45,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-13 21:32:45,702 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-13 21:32:45,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1952413286] [2019-10-13 21:32:45,908 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:32:45,909 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:45,909 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:45,909 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:45,910 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:45,938 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:46,057 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:46,086 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:46,091 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:46,092 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:46,092 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:46,093 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:46,093 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~x~0 4) |main_~#array~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:46,093 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:46,093 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-13 21:32:46,094 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:46,094 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:46,094 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:46,095 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:32:46,095 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:46,095 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:46,096 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:46,096 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:46,413 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:46,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13, 11] total 35 [2019-10-13 21:32:46,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756153254] [2019-10-13 21:32:46,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-13 21:32:46,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:46,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-13 21:32:46,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=861, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 21:32:46,416 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 35 states. [2019-10-13 21:32:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:48,218 INFO L93 Difference]: Finished difference Result 81 states and 109 transitions. [2019-10-13 21:32:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-13 21:32:48,219 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-10-13 21:32:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:48,220 INFO L225 Difference]: With dead ends: 81 [2019-10-13 21:32:48,220 INFO L226 Difference]: Without dead ends: 62 [2019-10-13 21:32:48,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2038 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1711, Invalid=5429, Unknown=0, NotChecked=0, Total=7140 [2019-10-13 21:32:48,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-10-13 21:32:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2019-10-13 21:32:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-13 21:32:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-10-13 21:32:48,236 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 31 [2019-10-13 21:32:48,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:48,237 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-10-13 21:32:48,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-13 21:32:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-10-13 21:32:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 21:32:48,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:48,239 INFO L380 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:48,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:48,452 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:48,453 INFO L82 PathProgramCache]: Analyzing trace with hash -170402355, now seen corresponding path program 4 times [2019-10-13 21:32:48,453 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:48,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489807788] [2019-10-13 21:32:48,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:48,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:48,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-13 21:32:48,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489807788] [2019-10-13 21:32:48,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536338621] [2019-10-13 21:32:48,855 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:32:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:48,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 21:32:48,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:32:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-13 21:32:48,975 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:32:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-13 21:32:49,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1581142463] [2019-10-13 21:32:49,695 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:32:49,696 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:32:49,696 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:32:49,696 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:32:49,697 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:32:49,726 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:32:49,851 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:32:49,868 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:32:49,874 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:32:49,875 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:32:49,875 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:32:49,875 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:49,876 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~x~0 4) |main_~#array~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:49,876 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:32:49,876 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-13 21:32:49,877 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:32:49,877 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,877 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= |#valid| |old(#valid)|) (<= 0 |#NULL.base|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (= |old(#length)| |#length|) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,878 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:32:49,878 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:32:49,878 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:32:49,879 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:32:49,879 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:32:50,295 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:32:50,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25, 11] total 59 [2019-10-13 21:32:50,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404092919] [2019-10-13 21:32:50,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-13 21:32:50,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:32:50,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-13 21:32:50,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1205, Invalid=2217, Unknown=0, NotChecked=0, Total=3422 [2019-10-13 21:32:50,300 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 59 states. [2019-10-13 21:32:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:32:53,593 INFO L93 Difference]: Finished difference Result 141 states and 193 transitions. [2019-10-13 21:32:53,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-13 21:32:53,595 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-10-13 21:32:53,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:32:53,596 INFO L225 Difference]: With dead ends: 141 [2019-10-13 21:32:53,597 INFO L226 Difference]: Without dead ends: 110 [2019-10-13 21:32:53,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3559, Invalid=8873, Unknown=0, NotChecked=0, Total=12432 [2019-10-13 21:32:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-13 21:32:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-10-13 21:32:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-13 21:32:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2019-10-13 21:32:53,618 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 55 [2019-10-13 21:32:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:32:53,618 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2019-10-13 21:32:53,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-13 21:32:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2019-10-13 21:32:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 21:32:53,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:32:53,620 INFO L380 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:32:53,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:32:53,830 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:32:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:32:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1764506675, now seen corresponding path program 5 times [2019-10-13 21:32:53,831 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 21:32:53,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684874485] [2019-10-13 21:32:53,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:53,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:32:53,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:32:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:32:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-10-13 21:32:54,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684874485] [2019-10-13 21:32:54,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790396142] [2019-10-13 21:32:54,905 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:33:12,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-13 21:33:12,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:33:12,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-13 21:33:12,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:33:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:33:12,657 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:33:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-10-13 21:33:15,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [65173437] [2019-10-13 21:33:15,061 INFO L162 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-10-13 21:33:15,061 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 21:33:15,062 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 21:33:15,062 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 21:33:15,062 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 21:33:15,089 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 21:33:15,157 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 21:33:15,167 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 21:33:15,171 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 21:33:15,171 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 21:33:15,171 INFO L193 IcfgInterpreter]: Reachable states at location L2 satisfy 130#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 21:33:15,171 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 140#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:33:15,172 INFO L193 IcfgInterpreter]: Reachable states at location L22 satisfy 120#(and (< main_~x~0 100000) (<= 1 main_~i~0) (= main_~x~0 0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* main_~x~0 4) |main_~#array~0.offset|)) |main_#t~mem7|) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:15,172 INFO L193 IcfgInterpreter]: Reachable states at location L2-1 satisfy 135#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 21:33:15,172 INFO L193 IcfgInterpreter]: Reachable states at location L15-3 satisfy 110#(<= 1 main_~i~0) [2019-10-13 21:33:15,172 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 144#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 21:33:15,172 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:15,173 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:33:15,173 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 149#(and (= |#valid| (store |old(#valid)| 0 0)) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) [2019-10-13 21:33:15,173 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 68#true [2019-10-13 21:33:15,173 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 21:33:15,173 INFO L193 IcfgInterpreter]: Reachable states at location L21-3 satisfy 115#(and (<= 1 main_~i~0) (= main_~x~0 0) (<= 100000 main_~i~0) (not (< main_~i~0 100000)) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-13 21:33:15,174 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 125#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 21:33:15,656 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 21:33:15,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48, 11] total 105 [2019-10-13 21:33:15,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15895104] [2019-10-13 21:33:15,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-10-13 21:33:15,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 21:33:15,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-10-13 21:33:15,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4494, Invalid=6426, Unknown=0, NotChecked=0, Total=10920 [2019-10-13 21:33:15,662 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 105 states.