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/loop-crafted/simple_array_index_value_3.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:57:47,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:57:47,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:57:47,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:57:47,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:57:47,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:57:47,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:57:47,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:57:47,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:57:47,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:57:47,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:57:47,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:57:47,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:57:47,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:57:47,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:57:47,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:57:47,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:57:47,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:57:47,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:57:47,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:57:47,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:57:47,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:57:47,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:57:47,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:57:47,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:57:47,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:57:47,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:57:47,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:57:47,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:57:47,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:57:47,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:57:47,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:57:47,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:57:47,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:57:47,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:57:47,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:57:47,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:57:48,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:57:48,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:57:48,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:57:48,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:57:48,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 22:57:48,034 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:57:48,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:57:48,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:57:48,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:57:48,036 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:57:48,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:57:48,036 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:57:48,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:57:48,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:57:48,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:57:48,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:57:48,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:57:48,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:57:48,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:57:48,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:57:48,038 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:57:48,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:57:48,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:57:48,038 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:57:48,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:57:48,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:57:48,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:57:48,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:57:48,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:57:48,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:57:48,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:57:48,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:57:48,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:57:48,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:57:48,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:57:48,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:57:48,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:57:48,336 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:57:48,336 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:57:48,337 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2019-10-13 22:57:48,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86cae100d/95c6b813423b4c52aa4b908311b7c62d/FLAGc1887b3e2 [2019-10-13 22:57:48,865 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:57:48,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_3.i [2019-10-13 22:57:48,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86cae100d/95c6b813423b4c52aa4b908311b7c62d/FLAGc1887b3e2 [2019-10-13 22:57:49,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86cae100d/95c6b813423b4c52aa4b908311b7c62d [2019-10-13 22:57:49,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:57:49,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:57:49,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:49,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:57:49,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:57:49,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:49" (1/1) ... [2019-10-13 22:57:49,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9b8ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:49, skipping insertion in model container [2019-10-13 22:57:49,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:49" (1/1) ... [2019-10-13 22:57:49,262 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:57:49,279 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:57:49,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:49,501 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:57:49,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:49,633 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:57:49,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:49 WrapperNode [2019-10-13 22:57:49,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:49,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:57:49,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:57:49,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:57:49,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:49" (1/1) ... [2019-10-13 22:57:49,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:49" (1/1) ... [2019-10-13 22:57:49,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:49" (1/1) ... [2019-10-13 22:57:49,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:49" (1/1) ... [2019-10-13 22:57:49,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:49" (1/1) ... [2019-10-13 22:57:49,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:49" (1/1) ... [2019-10-13 22:57:49,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:49" (1/1) ... [2019-10-13 22:57:49,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:57:49,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:57:49,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:57:49,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:57:49,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:57:49,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:57:49,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:57:49,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 22:57:49,741 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:57:49,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:57:49,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:57:49,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:57:49,742 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:57:49,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 22:57:49,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:57:49,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:57:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:57:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:57:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:57:50,099 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:57:50,100 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 22:57:50,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:50 BoogieIcfgContainer [2019-10-13 22:57:50,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:57:50,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:57:50,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:57:50,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:57:50,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:57:49" (1/3) ... [2019-10-13 22:57:50,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34afd514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:50, skipping insertion in model container [2019-10-13 22:57:50,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:49" (2/3) ... [2019-10-13 22:57:50,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34afd514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:50, skipping insertion in model container [2019-10-13 22:57:50,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:50" (3/3) ... [2019-10-13 22:57:50,109 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_3.i [2019-10-13 22:57:50,118 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:57:50,125 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:57:50,137 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:57:50,157 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:57:50,157 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:57:50,157 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:57:50,158 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:57:50,158 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:57:50,158 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:57:50,158 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:57:50,158 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:57:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-10-13 22:57:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:57:50,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:50,179 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:50,182 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:50,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash 793121937, now seen corresponding path program 1 times [2019-10-13 22:57:50,193 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:50,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153631140] [2019-10-13 22:57:50,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:50,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:50,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:50,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153631140] [2019-10-13 22:57:50,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:50,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:57:50,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439301082] [2019-10-13 22:57:50,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:57:50,384 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:50,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:57:50,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:57:50,399 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-10-13 22:57:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:50,466 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-13 22:57:50,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:57:50,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-13 22:57:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:50,479 INFO L225 Difference]: With dead ends: 34 [2019-10-13 22:57:50,479 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 22:57:50,484 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:57:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 22:57:50,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-10-13 22:57:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-13 22:57:50,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-13 22:57:50,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2019-10-13 22:57:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:50,529 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-13 22:57:50,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:57:50,529 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-13 22:57:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 22:57:50,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:50,530 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:50,531 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:50,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:50,531 INFO L82 PathProgramCache]: Analyzing trace with hash 751349671, now seen corresponding path program 1 times [2019-10-13 22:57:50,532 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:50,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244342179] [2019-10-13 22:57:50,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:50,532 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:50,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:50,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244342179] [2019-10-13 22:57:50,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155861934] [2019-10-13 22:57:50,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:50,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 22:57:50,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:50,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 22:57:50,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:57:50,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:57:50,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 22:57:50,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-13 22:57:50,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:50,889 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:50,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:50,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:51,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 22:57:51,131 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-10-13 22:57:51,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 22:57:51,146 INFO L567 ElimStorePlain]: treesize reduction 6, result has 80.6 percent of original size [2019-10-13 22:57:51,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-10-13 22:57:51,160 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-10-13 22:57:51,162 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-10-13 22:57:51,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:57:51,168 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-13 22:57:51,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 22:57:51,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 22:57:51,195 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:63, output treesize:22 [2019-10-13 22:57:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:51,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [429757135] [2019-10-13 22:57:51,259 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:57:51,260 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:51,266 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:51,273 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:51,274 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:51,424 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:57:51,630 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:57:51,718 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-13 22:57:51,731 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:57:51,737 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:51,737 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:51,737 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 22:57:51,738 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 22:57:51,738 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 64#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (= 0 main_~index~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0)) [2019-10-13 22:57:51,738 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 59#(and (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~tmp~0 0) (= 0 |main_~#array~0.offset|) (< |main_~#array~0.base| |#StackHeapBarrier|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (<= main_~tmp~0 0) (<= 0 main_~tmp~0) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 main_~tmp~0) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:57:51,739 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 104#(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 22:57:51,739 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 85#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (mod (select (select |#memory_int| v_prenex_5) 0) 4294967296) 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:51,739 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:51,740 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 99#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:57:51,740 INFO L193 IcfgInterpreter]: Reachable states at location L31-2 satisfy 75#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= main_~index~0 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= main_~index~0 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:57:51,740 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 80#(exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (mod (select (select |#memory_int| v_prenex_5) 0) 4294967296) 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 22:57:51,741 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 95#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (mod (select (select |#memory_int| v_prenex_5) 0) 4294967296) 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:51,741 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 90#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((|v_main_~#array~0.base_BEFORE_CALL_1| Int) (v_prenex_5 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_1|) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= (mod (select (select |#memory_int| v_prenex_5) 0) 4294967296) 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:52,388 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:52,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8, 9] total 24 [2019-10-13 22:57:52,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890349045] [2019-10-13 22:57:52,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 22:57:52,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:52,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 22:57:52,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-10-13 22:57:52,396 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 24 states. [2019-10-13 22:57:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:53,429 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-10-13 22:57:53,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 22:57:53,429 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 12 [2019-10-13 22:57:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:53,430 INFO L225 Difference]: With dead ends: 38 [2019-10-13 22:57:53,430 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 22:57:53,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 22:57:53,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 22:57:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2019-10-13 22:57:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-13 22:57:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-13 22:57:53,438 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-10-13 22:57:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:53,439 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-13 22:57:53,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 22:57:53,439 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-13 22:57:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 22:57:53,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:53,440 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:53,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:53,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:53,644 INFO L82 PathProgramCache]: Analyzing trace with hash -543590575, now seen corresponding path program 2 times [2019-10-13 22:57:53,645 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:53,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601739738] [2019-10-13 22:57:53,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:53,646 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:53,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:53,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601739738] [2019-10-13 22:57:53,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762316513] [2019-10-13 22:57:53,732 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 22:57:53,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 22:57:53,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:57:53,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 22:57:53,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:53,811 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:53,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1792247633] [2019-10-13 22:57:53,844 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:57:53,845 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:53,845 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:53,845 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:53,845 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:53,890 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:57:54,028 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:57:54,125 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-13 22:57:54,143 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:57:54,151 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:54,152 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:54,152 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 22:57:54,152 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 22:57:54,153 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 64#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (= 0 main_~index~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0)) [2019-10-13 22:57:54,153 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 59#(and (or (and (= 0 |#NULL.base|) (= main_~tmp~0 0) (= 0 |main_~#array~0.offset|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (< |main_~#array~0.base| |#StackHeapBarrier|) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (<= main_~tmp~0 0) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (= |#NULL.offset| 0))) (<= |#NULL.base| 0) (<= 0 main_~tmp~0) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:57:54,153 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 104#(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 22:57:54,154 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 85#(and (exists ((v_prenex_7 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 0 (mod (select (select |#memory_int| v_prenex_7) 0) 4294967296))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) 0) 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:54,154 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:54,154 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 99#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:57:54,155 INFO L193 IcfgInterpreter]: Reachable states at location L31-2 satisfy 75#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= main_~index~0 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= main_~index~0 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:57:54,155 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 80#(exists ((v_prenex_7 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 0 (mod (select (select |#memory_int| v_prenex_7) 0) 4294967296))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) 0) 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 22:57:54,156 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 95#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_7 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 0 (mod (select (select |#memory_int| v_prenex_7) 0) 4294967296))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) 0) 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:54,156 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 90#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_7 Int) (|v_main_~#array~0.base_BEFORE_CALL_2| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= 0 (mod (select (select |#memory_int| v_prenex_7) 0) 4294967296))) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_2|) 0) 4294967296)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:54,504 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:54,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 9] total 18 [2019-10-13 22:57:54,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650448944] [2019-10-13 22:57:54,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 22:57:54,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:54,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 22:57:54,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-13 22:57:54,507 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 18 states. [2019-10-13 22:57:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:57,464 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-10-13 22:57:57,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 22:57:57,465 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 13 [2019-10-13 22:57:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:57,467 INFO L225 Difference]: With dead ends: 47 [2019-10-13 22:57:57,467 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 22:57:57,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2019-10-13 22:57:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 22:57:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2019-10-13 22:57:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 22:57:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-13 22:57:57,477 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 13 [2019-10-13 22:57:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:57,477 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-13 22:57:57,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 22:57:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-13 22:57:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 22:57:57,478 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:57,478 INFO L380 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:57,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:57:57,679 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2029835055, now seen corresponding path program 3 times [2019-10-13 22:57:57,680 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:57,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433460704] [2019-10-13 22:57:57,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:57,681 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:57,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:57,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433460704] [2019-10-13 22:57:57,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260008845] [2019-10-13 22:57:57,859 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 22:57:57,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:57:57,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:57:57,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 22:57:57,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:57:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:58,002 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:57:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:58,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [959712166] [2019-10-13 22:57:58,151 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:57:58,151 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:57:58,151 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:57:58,152 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:57:58,152 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:57:58,198 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:57:58,268 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:57:58,328 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-13 22:57:58,357 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:57:58,363 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:57:58,363 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:57:58,363 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 22:57:58,364 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 22:57:58,364 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 64#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (= 0 main_~index~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0)) [2019-10-13 22:57:58,364 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 59#(and (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~tmp~0 0) (= 0 |main_~#array~0.offset|) (< |main_~#array~0.base| |#StackHeapBarrier|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (<= main_~tmp~0 0) (<= 0 main_~tmp~0) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 main_~tmp~0) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:57:58,365 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 104#(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 22:57:58,365 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 85#(and (exists ((|v_main_~#array~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| v_prenex_9) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) 0) 4294967296) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:58,365 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:57:58,366 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 99#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:57:58,369 INFO L193 IcfgInterpreter]: Reachable states at location L31-2 satisfy 75#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= main_~index~0 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= main_~index~0 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:57:58,369 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 80#(exists ((|v_main_~#array~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| v_prenex_9) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) 0) 4294967296) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 22:57:58,369 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 95#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#array~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| v_prenex_9) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) 0) 4294967296) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:58,370 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 90#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond) (exists ((|v_main_~#array~0.base_BEFORE_CALL_3| Int) (v_prenex_9 Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (not (= (mod (select (select |#memory_int| v_prenex_9) 0) 4294967296) 0)) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_3|) 0) 4294967296) 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:57:58,837 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:57:58,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 26 [2019-10-13 22:57:58,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852579365] [2019-10-13 22:57:58,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 22:57:58,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 22:57:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2019-10-13 22:57:58,840 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 26 states. [2019-10-13 22:57:59,772 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2019-10-13 22:58:02,124 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2019-10-13 22:58:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:58:19,611 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2019-10-13 22:58:19,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 22:58:19,611 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 17 [2019-10-13 22:58:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:58:19,613 INFO L225 Difference]: With dead ends: 84 [2019-10-13 22:58:19,613 INFO L226 Difference]: Without dead ends: 75 [2019-10-13 22:58:19,614 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=400, Invalid=1580, Unknown=0, NotChecked=0, Total=1980 [2019-10-13 22:58:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-13 22:58:19,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 29. [2019-10-13 22:58:19,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 22:58:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-10-13 22:58:19,626 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 17 [2019-10-13 22:58:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:58:19,627 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-10-13 22:58:19,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 22:58:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-10-13 22:58:19,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 22:58:19,628 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:58:19,628 INFO L380 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:58:19,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:58:19,832 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:58:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:58:19,832 INFO L82 PathProgramCache]: Analyzing trace with hash 45242321, now seen corresponding path program 4 times [2019-10-13 22:58:19,833 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:58:19,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662495767] [2019-10-13 22:58:19,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:19,833 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:58:19,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:58:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:20,141 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:20,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662495767] [2019-10-13 22:58:20,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389306650] [2019-10-13 22:58:20,142 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 22:58:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:58:20,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-13 22:58:20,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:58:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:20,266 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:58:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:58:20,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1005586050] [2019-10-13 22:58:20,900 INFO L162 IcfgInterpreter]: Started Sifa with 12 locations of interest [2019-10-13 22:58:20,900 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:58:20,900 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:58:20,900 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:58:20,901 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:58:20,938 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 22:58:21,025 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 22:58:21,077 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 30 for LOIs [2019-10-13 22:58:21,086 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 22:58:21,089 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:58:21,090 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:58:21,090 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 22:58:21,090 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 22:58:21,090 INFO L193 IcfgInterpreter]: Reachable states at location L30-3 satisfy 77#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (= 0 main_~index~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|) (<= main_~index~0 0)) [2019-10-13 22:58:21,091 INFO L193 IcfgInterpreter]: Reachable states at location L24-2 satisfy 72#(and (or (and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (= main_~tmp~0 0) (= 0 |main_~#array~0.offset|) (< |main_~#array~0.base| |#StackHeapBarrier|) (= (select |old(#valid)| |main_~#array~0.base|) 0) (= |#valid| (store |old(#valid)| |main_~#array~0.base| 1)) (= 0 (select |old(#valid)| 0)) (not (= |main_~#array~0.base| 0)) (<= |main_~#array~0.offset| 0) (= (store |old(#length)| |main_~#array~0.base| 40000) |#length|) (<= main_~tmp~0 0) (<= 0 main_~tmp~0) (= 0 main_~index~0) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| 0) (<= main_~index~0 0)) (and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (<= 0 main_~tmp~0) (= |#NULL.offset| 0))) (<= 0 |#NULL.base|) (<= 0 main_~index~0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:58:21,091 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 117#(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 22:58:21,091 INFO L193 IcfgInterpreter]: Reachable states at location L12 satisfy 98#(and (exists ((v_prenex_11 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) 0) 4294967296))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= 0 (mod (select (select |#memory_int| v_prenex_11) 0) 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:58:21,091 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:58:21,091 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 112#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 22:58:21,091 INFO L193 IcfgInterpreter]: Reachable states at location L31-2 satisfy 88#(and (= |#NULL.base| 0) (= |main_~#array~0.offset| 0) (<= |#NULL.base| 0) (= main_~index~0 0) (<= 0 |#NULL.base|) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= |main_~#array~0.offset| 0) (<= 0 main_~tmp~0) (<= 0 main_~index~0) (= |#NULL.offset| 0) (<= main_~index~0 0) (<= 0 |main_~#array~0.offset|)) [2019-10-13 22:58:21,092 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 93#(exists ((v_prenex_11 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) 0) 4294967296))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= 0 (mod (select (select |#memory_int| v_prenex_11) 0) 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) [2019-10-13 22:58:21,092 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 108#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_11 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) 0) 4294967296))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= 0 (mod (select (select |#memory_int| v_prenex_11) 0) 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:58:21,092 INFO L193 IcfgInterpreter]: Reachable states at location L13 satisfy 103#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_11 Int) (|v_main_~#array~0.base_BEFORE_CALL_4| Int)) (or (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 0) (<= |#NULL.base| 0) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (not (= 0 (mod (select (select |#memory_int| |v_main_~#array~0.base_BEFORE_CALL_4|) 0) 4294967296))) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)) (and (= |#NULL.base| 0) (= |__VERIFIER_assert_#in~cond| 1) (<= |#NULL.base| 0) (= 0 (mod (select (select |#memory_int| v_prenex_11) 0) 4294967296)) (<= 0 |#NULL.base|) (= |#NULL.offset| 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0)))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-13 22:58:21,694 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:58:21,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17, 9] total 42 [2019-10-13 22:58:21,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617951396] [2019-10-13 22:58:21,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-13 22:58:21,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:58:21,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-13 22:58:21,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=1362, Unknown=0, NotChecked=0, Total=1722 [2019-10-13 22:58:21,698 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 42 states. [2019-10-13 22:58:27,529 WARN L191 SmtUtils]: Spent 4.56 s on a formula simplification. DAG size of input: 77 DAG size of output: 25 [2019-10-13 22:58:34,251 WARN L191 SmtUtils]: Spent 4.56 s on a formula simplification. DAG size of input: 73 DAG size of output: 25