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/reducercommutativity/max40-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:20:15,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:20:15,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:20:15,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:20:15,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:20:15,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:20:15,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:20:15,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:20:15,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:20:15,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:20:15,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:20:15,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:20:15,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:20:15,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:20:15,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:20:15,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:20:15,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:20:15,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:20:15,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:20:15,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:20:15,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:20:15,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:20:15,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:20:15,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:20:15,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:20:15,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:20:15,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:20:15,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:20:15,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:20:15,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:20:15,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:20:15,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:20:15,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:20:15,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:20:15,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:20:15,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:20:15,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:20:15,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:20:15,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:20:15,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:20:15,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:20:15,965 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 23:20:15,987 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:20:15,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:20:15,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:20:15,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:20:15,990 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:20:15,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:20:15,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:20:15,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:20:15,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:20:15,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:20:15,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:20:15,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:20:15,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:20:15,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:20:15,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:20:15,993 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:20:15,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:20:15,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:20:15,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:20:15,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:20:15,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:20:15,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:20:15,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:20:15,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:20:15,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:20:15,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:20:15,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:20:15,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:20:15,996 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 23:20:16,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:20:16,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:20:16,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:20:16,300 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:20:16,301 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:20:16,301 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/max40-1.i [2019-10-13 23:20:16,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db872327/adf064a4b043410bb6c3e2d2f0cc0db7/FLAG0a03d9961 [2019-10-13 23:20:16,792 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:20:16,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/max40-1.i [2019-10-13 23:20:16,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db872327/adf064a4b043410bb6c3e2d2f0cc0db7/FLAG0a03d9961 [2019-10-13 23:20:17,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db872327/adf064a4b043410bb6c3e2d2f0cc0db7 [2019-10-13 23:20:17,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:20:17,222 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:20:17,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:20:17,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:20:17,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:20:17,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:20:17" (1/1) ... [2019-10-13 23:20:17,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6836b2f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:17, skipping insertion in model container [2019-10-13 23:20:17,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:20:17" (1/1) ... [2019-10-13 23:20:17,241 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:20:17,260 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:20:17,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:20:17,502 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:20:17,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:20:17,545 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:20:17,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:17 WrapperNode [2019-10-13 23:20:17,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:20:17,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:20:17,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:20:17,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:20:17,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:17" (1/1) ... [2019-10-13 23:20:17,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:17" (1/1) ... [2019-10-13 23:20:17,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:17" (1/1) ... [2019-10-13 23:20:17,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:17" (1/1) ... [2019-10-13 23:20:17,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:17" (1/1) ... [2019-10-13 23:20:17,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:17" (1/1) ... [2019-10-13 23:20:17,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:17" (1/1) ... [2019-10-13 23:20:17,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:20:17,685 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:20:17,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:20:17,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:20:17,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:17" (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 23:20:17,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:20:17,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:20:17,748 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2019-10-13 23:20:17,748 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:20:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:20:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 23:20:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure max [2019-10-13 23:20:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 23:20:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:20:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 23:20:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 23:20:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 23:20:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:20:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:20:18,171 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:20:18,171 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 23:20:18,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:20:18 BoogieIcfgContainer [2019-10-13 23:20:18,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:20:18,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:20:18,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:20:18,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:20:18,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:20:17" (1/3) ... [2019-10-13 23:20:18,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e104f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:20:18, skipping insertion in model container [2019-10-13 23:20:18,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:20:17" (2/3) ... [2019-10-13 23:20:18,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e104f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:20:18, skipping insertion in model container [2019-10-13 23:20:18,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:20:18" (3/3) ... [2019-10-13 23:20:18,180 INFO L109 eAbstractionObserver]: Analyzing ICFG max40-1.i [2019-10-13 23:20:18,192 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:20:18,199 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:20:18,211 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:20:18,234 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:20:18,234 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:20:18,234 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:20:18,234 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:20:18,235 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:20:18,235 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:20:18,235 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:20:18,235 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:20:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-13 23:20:18,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 23:20:18,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:18,259 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:18,261 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:18,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash 855740909, now seen corresponding path program 1 times [2019-10-13 23:20:18,275 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:18,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218861727] [2019-10-13 23:20:18,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:18,276 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:18,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:20:18,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218861727] [2019-10-13 23:20:18,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:20:18,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:20:18,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848197635] [2019-10-13 23:20:18,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:18,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:18,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:18,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:20:18,485 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-13 23:20:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:18,523 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2019-10-13 23:20:18,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:18,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 23:20:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:18,533 INFO L225 Difference]: With dead ends: 41 [2019-10-13 23:20:18,533 INFO L226 Difference]: Without dead ends: 20 [2019-10-13 23:20:18,537 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 23:20:18,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-13 23:20:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-13 23:20:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 23:20:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-10-13 23:20:18,572 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2019-10-13 23:20:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:18,573 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-10-13 23:20:18,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2019-10-13 23:20:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 23:20:18,576 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:18,576 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:18,576 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:18,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:18,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1075349738, now seen corresponding path program 1 times [2019-10-13 23:20:18,577 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:18,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722828926] [2019-10-13 23:20:18,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:18,578 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:18,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:20:18,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722828926] [2019-10-13 23:20:18,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580284775] [2019-10-13 23:20:18,665 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 23:20:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:18,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 23:20:18,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:20:18,820 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:20:18,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:20:18,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2019-10-13 23:20:18,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854745294] [2019-10-13 23:20:18,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:18,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:18,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:18,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:20:18,865 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 3 states. [2019-10-13 23:20:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:18,877 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-10-13 23:20:18,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:18,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 23:20:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:18,879 INFO L225 Difference]: With dead ends: 33 [2019-10-13 23:20:18,879 INFO L226 Difference]: Without dead ends: 21 [2019-10-13 23:20:18,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:20:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-13 23:20:18,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-13 23:20:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-13 23:20:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-13 23:20:18,886 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2019-10-13 23:20:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:18,886 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-13 23:20:18,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-13 23:20:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 23:20:18,888 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:18,888 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:19,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:19,093 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:19,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash 447698074, now seen corresponding path program 1 times [2019-10-13 23:20:19,094 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:19,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56854909] [2019-10-13 23:20:19,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:19,094 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:19,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:19,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56854909] [2019-10-13 23:20:19,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:20:19,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:20:19,217 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273923048] [2019-10-13 23:20:19,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:20:19,218 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:19,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:20:19,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:20:19,218 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 3 states. [2019-10-13 23:20:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:19,237 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-10-13 23:20:19,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:20:19,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 23:20:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:19,239 INFO L225 Difference]: With dead ends: 31 [2019-10-13 23:20:19,240 INFO L226 Difference]: Without dead ends: 22 [2019-10-13 23:20:19,241 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 23:20:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-13 23:20:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-13 23:20:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-13 23:20:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-13 23:20:19,251 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2019-10-13 23:20:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:19,256 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-13 23:20:19,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:20:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-13 23:20:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 23:20:19,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:19,259 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:19,260 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash -69054062, now seen corresponding path program 1 times [2019-10-13 23:20:19,260 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:19,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981459169] [2019-10-13 23:20:19,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:19,261 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:19,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:19,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981459169] [2019-10-13 23:20:19,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215347208] [2019-10-13 23:20:19,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:19,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:20:19,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:19,460 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:19,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1279834678] [2019-10-13 23:20:19,552 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:19,552 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:19,560 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:19,572 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:19,573 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:19,731 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:20:21,901 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-13 23:20:21,966 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:20:21,973 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:20:21,973 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:20:21,973 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 656#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:20:21,974 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 652#(and (not (< max_~i~0 40)) (<= 40 max_~i~0) (<= 0 max_~i~0) (= (ite (<= (mod max_~ret~0 4294967296) 2147483647) (mod max_~ret~0 4294967296) (+ (mod max_~ret~0 4294967296) (- 4294967296))) |max_#res|)) [2019-10-13 23:20:21,974 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 483#true [2019-10-13 23:20:21,974 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 526#(and (<= 39 main_~i~2) (not (< main_~i~2 39)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) [2019-10-13 23:20:21,974 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 647#(<= 0 max_~i~0) [2019-10-13 23:20:21,975 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 23:20:21,975 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 23:20:21,975 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(or (exists ((v_max_~ret~0_BEFORE_RETURN_1 Int) (v_prenex_1 Int)) (or (and (not (< main_~i~1 40)) (= (+ (mod v_prenex_1 4294967296) (- 4294967296)) |main_#t~ret6|) (not (<= (mod v_prenex_1 4294967296) 2147483647))) (and (<= (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (not (< main_~i~1 40)) (= |main_#t~ret6| (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296))))) (exists ((v_prenex_2 Int) (v_max_~ret~0_BEFORE_RETURN_2 Int)) (or (and (not (<= (mod v_prenex_2 4294967296) 2147483647)) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 40))) (and (<= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647) (not (< main_~i~1 40)) (= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) |main_#t~ret6|))))) [2019-10-13 23:20:21,975 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 384#true [2019-10-13 23:20:21,976 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 661#(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 23:20:21,976 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:20:21,978 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 317#true [2019-10-13 23:20:21,978 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 238#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_29 Int) (v_max_~ret~0_BEFORE_RETURN_5 Int) (v_prenex_30 Int) (v_max_~ret~0_BEFORE_RETURN_6 Int)) (or (and (<= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= (+ (mod v_prenex_30 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_30 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156))))))) (and (exists ((v_prenex_29 Int) (v_max_~ret~0_BEFORE_RETURN_5 Int) (v_prenex_30 Int) (v_max_~ret~0_BEFORE_RETURN_6 Int)) (or (and (<= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= (mod v_max_~ret~0_BEFORE_RETURN_5 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (not (<= (mod v_prenex_29 4294967296) 2147483647)) (= main_~ret5~0 (+ (mod v_prenex_29 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_max_~ret~0_BEFORE_RETURN_6 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= (+ (mod v_prenex_30 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_30 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:20:21,978 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 605#true [2019-10-13 23:20:21,979 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 591#true [2019-10-13 23:20:21,979 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 564#true [2019-10-13 23:20:21,979 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 40)) (<= 40 main_~i~1)) [2019-10-13 23:20:21,979 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 596#(exists ((v_max_~ret~0_BEFORE_RETURN_1 Int) (v_prenex_2 Int) (v_max_~ret~0_BEFORE_RETURN_2 Int) (v_prenex_1 Int)) (or (and (<= (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296) 2147483647) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~ret~1 (mod v_max_~ret~0_BEFORE_RETURN_1 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) 2147483647) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_max_~ret~0_BEFORE_RETURN_2 4294967296) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_prenex_2 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (+ (mod v_prenex_2 4294967296) (- 4294967296)) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_prenex_1 4294967296) (- 4294967296))) (not (<= (mod v_prenex_1 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:20:21,979 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:20:22,353 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:20:22,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-13 23:20:22,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827193532] [2019-10-13 23:20:22,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 23:20:22,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:22,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 23:20:22,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:20:22,357 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 18 states. [2019-10-13 23:20:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:23,027 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2019-10-13 23:20:23,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:20:23,028 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-10-13 23:20:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:23,029 INFO L225 Difference]: With dead ends: 40 [2019-10-13 23:20:23,029 INFO L226 Difference]: Without dead ends: 25 [2019-10-13 23:20:23,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-13 23:20:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-13 23:20:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-10-13 23:20:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-13 23:20:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-10-13 23:20:23,037 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 29 [2019-10-13 23:20:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:23,037 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-10-13 23:20:23,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 23:20:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-10-13 23:20:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 23:20:23,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:23,039 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:23,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:23,244 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:23,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:23,244 INFO L82 PathProgramCache]: Analyzing trace with hash -493974743, now seen corresponding path program 2 times [2019-10-13 23:20:23,244 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:23,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236389332] [2019-10-13 23:20:23,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:23,245 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:23,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 23:20:23,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236389332] [2019-10-13 23:20:23,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834897458] [2019-10-13 23:20:23,371 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:23,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 23:20:23,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:20:23,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:20:23,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 23:20:23,470 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-13 23:20:23,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1857040697] [2019-10-13 23:20:23,505 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:23,505 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:23,510 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:23,510 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:23,511 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:23,547 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:20:24,978 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-13 23:20:25,009 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:20:25,013 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:20:25,013 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:20:25,014 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 656#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:20:25,014 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 652#(and (not (< max_~i~0 40)) (<= 40 max_~i~0) (<= 0 max_~i~0) (= (ite (<= (mod max_~ret~0 4294967296) 2147483647) (mod max_~ret~0 4294967296) (+ (mod max_~ret~0 4294967296) (- 4294967296))) |max_#res|)) [2019-10-13 23:20:25,014 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 483#true [2019-10-13 23:20:25,014 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 526#(and (<= 39 main_~i~2) (not (< main_~i~2 39)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) [2019-10-13 23:20:25,015 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 647#(<= 0 max_~i~0) [2019-10-13 23:20:25,015 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 23:20:25,015 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 23:20:25,015 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(or (exists ((v_prenex_195 Int) (v_max_~ret~0_BEFORE_RETURN_27 Int)) (or (and (not (< main_~i~1 40)) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647)) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_27 4294967296) (- 4294967296)) |main_#t~ret6|)) (and (= (mod v_prenex_195 4294967296) |main_#t~ret6|) (not (< main_~i~1 40)) (<= (mod v_prenex_195 4294967296) 2147483647)))) (exists ((v_prenex_196 Int) (v_max_~ret~0_BEFORE_RETURN_28 Int)) (or (and (not (< main_~i~1 40)) (<= (mod v_max_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647) (= |main_#t~ret6| (mod v_max_~ret~0_BEFORE_RETURN_28 4294967296))) (and (not (<= (mod v_prenex_196 4294967296) 2147483647)) (not (< main_~i~1 40)) (= (+ (mod v_prenex_196 4294967296) (- 4294967296)) |main_#t~ret6|))))) [2019-10-13 23:20:25,015 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 384#true [2019-10-13 23:20:25,016 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 661#(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 23:20:25,016 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:20:25,016 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 317#true [2019-10-13 23:20:25,017 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 238#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_224 Int) (v_max_~ret~0_BEFORE_RETURN_32 Int) (v_max_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_223 Int)) (or (and (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_31 4294967296) (- 4294967296))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_223 4294967296) 2147483647) (= (mod v_prenex_223 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (not (<= (mod v_max_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156))))))) (and (exists ((v_prenex_224 Int) (v_max_~ret~0_BEFORE_RETURN_32 Int) (v_max_~ret~0_BEFORE_RETURN_31 Int) (v_prenex_223 Int)) (or (and (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_31 4294967296) (- 4294967296))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_31 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_223 4294967296) 2147483647) (= (mod v_prenex_223 4294967296) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (not (<= (mod v_max_~ret~0_BEFORE_RETURN_32 4294967296) 2147483647)) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_32 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_224 4294967296) 2147483647) (= main_~ret5~0 (mod v_prenex_224 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:20:25,031 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 605#true [2019-10-13 23:20:25,031 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 591#true [2019-10-13 23:20:25,031 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 564#true [2019-10-13 23:20:25,031 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 40)) (<= 40 main_~i~1)) [2019-10-13 23:20:25,032 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 596#(exists ((v_prenex_196 Int) (v_prenex_195 Int) (v_max_~ret~0_BEFORE_RETURN_28 Int) (v_max_~ret~0_BEFORE_RETURN_27 Int)) (or (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_prenex_195 4294967296) main_~ret~1) (<= (mod v_prenex_195 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (= (+ (mod v_prenex_196 4294967296) (- 4294967296)) main_~ret~1) (not (<= (mod v_prenex_196 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_27 4294967296) 2147483647)) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_27 4294967296) (- 4294967296)) main_~ret~1) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (= main_~ret~1 (mod v_max_~ret~0_BEFORE_RETURN_28 4294967296)) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (<= (mod v_max_~ret~0_BEFORE_RETURN_28 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:20:25,032 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:20:25,413 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:20:25,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 11] total 21 [2019-10-13 23:20:25,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517955917] [2019-10-13 23:20:25,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 23:20:25,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:25,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 23:20:25,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-13 23:20:25,416 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 22 states. [2019-10-13 23:20:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:26,309 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-10-13 23:20:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 23:20:26,310 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-13 23:20:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:26,311 INFO L225 Difference]: With dead ends: 44 [2019-10-13 23:20:26,311 INFO L226 Difference]: Without dead ends: 29 [2019-10-13 23:20:26,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 23:20:26,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-13 23:20:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-13 23:20:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-13 23:20:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-13 23:20:26,320 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2019-10-13 23:20:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:26,320 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-13 23:20:26,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 23:20:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-13 23:20:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-13 23:20:26,322 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:26,322 INFO L380 BasicCegarLoop]: trace histogram [12, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:26,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:26,526 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash 132820922, now seen corresponding path program 3 times [2019-10-13 23:20:26,527 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:26,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889322589] [2019-10-13 23:20:26,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:26,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:26,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-13 23:20:26,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889322589] [2019-10-13 23:20:26,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247519366] [2019-10-13 23:20:26,654 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:26,769 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 23:20:26,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:20:26,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 23:20:26,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:26,836 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 23:20:26,836 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-13 23:20:26,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [719347481] [2019-10-13 23:20:26,935 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:26,935 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:26,935 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:26,936 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:26,936 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:26,954 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:20:28,262 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-13 23:20:28,292 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:20:28,295 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:20:28,296 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:20:28,296 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 656#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:20:28,296 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 652#(and (not (< max_~i~0 40)) (<= 40 max_~i~0) (<= 0 max_~i~0) (= (ite (<= (mod max_~ret~0 4294967296) 2147483647) (mod max_~ret~0 4294967296) (+ (mod max_~ret~0 4294967296) (- 4294967296))) |max_#res|)) [2019-10-13 23:20:28,296 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 483#true [2019-10-13 23:20:28,297 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 526#(and (<= 39 main_~i~2) (not (< main_~i~2 39)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) [2019-10-13 23:20:28,297 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 647#(<= 0 max_~i~0) [2019-10-13 23:20:28,297 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 23:20:28,298 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 23:20:28,298 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(or (exists ((v_prenex_389 Int) (v_max_~ret~0_BEFORE_RETURN_53 Int)) (or (and (not (< main_~i~1 40)) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_53 4294967296) (- 4294967296)) |main_#t~ret6|) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647))) (and (not (< main_~i~1 40)) (<= (mod v_prenex_389 4294967296) 2147483647) (= |main_#t~ret6| (mod v_prenex_389 4294967296))))) (exists ((v_max_~ret~0_BEFORE_RETURN_54 Int) (v_prenex_390 Int)) (or (and (not (< main_~i~1 40)) (= |main_#t~ret6| (mod v_max_~ret~0_BEFORE_RETURN_54 4294967296)) (<= (mod v_max_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647)) (and (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 40)) (not (<= (mod v_prenex_390 4294967296) 2147483647)))))) [2019-10-13 23:20:28,298 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 384#true [2019-10-13 23:20:28,298 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 661#(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 23:20:28,299 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:20:28,299 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 317#true [2019-10-13 23:20:28,300 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 238#(or (and (exists ((v_max_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_417 Int) (v_prenex_418 Int) (v_max_~ret~0_BEFORE_RETURN_58 Int)) (or (and (<= (mod v_max_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647) (= (mod v_max_~ret~0_BEFORE_RETURN_57 4294967296) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (mod v_prenex_418 4294967296)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_418 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= (+ (mod v_max_~ret~0_BEFORE_RETURN_58 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (+ (mod v_prenex_417 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_417 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))))) (not (= main_~ret~1 main_~ret5~0))) (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_max_~ret~0_BEFORE_RETURN_57 Int) (v_prenex_417 Int) (v_prenex_418 Int) (v_max_~ret~0_BEFORE_RETURN_58 Int)) (or (and (<= (mod v_max_~ret~0_BEFORE_RETURN_57 4294967296) 2147483647) (= (mod v_max_~ret~0_BEFORE_RETURN_57 4294967296) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (mod v_prenex_418 4294967296)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_418 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= (+ (mod v_max_~ret~0_BEFORE_RETURN_58 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_58 4294967296) 2147483647)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (+ (mod v_prenex_417 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_417 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))))))) [2019-10-13 23:20:28,300 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 605#true [2019-10-13 23:20:28,300 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 591#true [2019-10-13 23:20:28,301 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 564#true [2019-10-13 23:20:28,301 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 40)) (<= 40 main_~i~1)) [2019-10-13 23:20:28,301 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 596#(exists ((v_prenex_389 Int) (v_max_~ret~0_BEFORE_RETURN_54 Int) (v_max_~ret~0_BEFORE_RETURN_53 Int) (v_prenex_390 Int)) (or (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (mod v_max_~ret~0_BEFORE_RETURN_54 4294967296)) (<= (mod v_max_~ret~0_BEFORE_RETURN_54 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_max_~ret~0_BEFORE_RETURN_53 4294967296) (- 4294967296))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_53 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= (mod v_prenex_389 4294967296) main_~ret~1) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_prenex_389 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= (+ (mod v_prenex_390 4294967296) (- 4294967296)) main_~ret~1) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_390 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:20:28,302 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:20:28,887 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:20:28,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 11] total 29 [2019-10-13 23:20:28,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588956237] [2019-10-13 23:20:28,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-13 23:20:28,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:28,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-13 23:20:28,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2019-10-13 23:20:28,896 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 30 states. [2019-10-13 23:20:30,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:30,143 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-10-13 23:20:30,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 23:20:30,143 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-10-13 23:20:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:30,144 INFO L225 Difference]: With dead ends: 55 [2019-10-13 23:20:30,144 INFO L226 Difference]: Without dead ends: 37 [2019-10-13 23:20:30,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=445, Invalid=2525, Unknown=0, NotChecked=0, Total=2970 [2019-10-13 23:20:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-13 23:20:30,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-10-13 23:20:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 23:20:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-13 23:20:30,153 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 42 [2019-10-13 23:20:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:30,153 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-13 23:20:30,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-13 23:20:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-13 23:20:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 23:20:30,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:30,155 INFO L380 BasicCegarLoop]: trace histogram [15, 12, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:30,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:30,356 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:30,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:30,357 INFO L82 PathProgramCache]: Analyzing trace with hash -431924951, now seen corresponding path program 4 times [2019-10-13 23:20:30,357 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:30,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302120981] [2019-10-13 23:20:30,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:30,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:30,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 37 proven. 52 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-13 23:20:30,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302120981] [2019-10-13 23:20:30,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786139870] [2019-10-13 23:20:30,497 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 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 23:20:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:30,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 23:20:30,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-13 23:20:30,796 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-13 23:20:31,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1326907051] [2019-10-13 23:20:31,122 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:31,123 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:31,123 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:31,123 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:31,124 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:31,142 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:20:32,559 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-13 23:20:32,581 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:20:32,584 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:20:32,584 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:20:32,585 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 656#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:20:32,585 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 652#(and (not (< max_~i~0 40)) (<= 40 max_~i~0) (<= 0 max_~i~0) (= (ite (<= (mod max_~ret~0 4294967296) 2147483647) (mod max_~ret~0 4294967296) (+ (mod max_~ret~0 4294967296) (- 4294967296))) |max_#res|)) [2019-10-13 23:20:32,585 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 483#true [2019-10-13 23:20:32,585 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 526#(and (<= 39 main_~i~2) (not (< main_~i~2 39)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) [2019-10-13 23:20:32,585 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 647#(<= 0 max_~i~0) [2019-10-13 23:20:32,586 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 23:20:32,586 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 23:20:32,586 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(or (exists ((v_max_~ret~0_BEFORE_RETURN_79 Int) (v_prenex_583 Int)) (or (and (not (< main_~i~1 40)) (<= (mod v_max_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647) (= (mod v_max_~ret~0_BEFORE_RETURN_79 4294967296) |main_#t~ret6|)) (and (= (+ (mod v_prenex_583 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 40)) (not (<= (mod v_prenex_583 4294967296) 2147483647))))) (exists ((v_prenex_584 Int) (v_max_~ret~0_BEFORE_RETURN_80 Int)) (or (and (not (< main_~i~1 40)) (<= (mod v_max_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647) (= (mod v_max_~ret~0_BEFORE_RETURN_80 4294967296) |main_#t~ret6|)) (and (not (< main_~i~1 40)) (= (+ (mod v_prenex_584 4294967296) (- 4294967296)) |main_#t~ret6|) (not (<= (mod v_prenex_584 4294967296) 2147483647)))))) [2019-10-13 23:20:32,586 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 661#(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 23:20:32,586 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 384#true [2019-10-13 23:20:32,586 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:20:32,587 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 317#true [2019-10-13 23:20:32,587 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 238#(or (and (exists ((v_prenex_611 Int) (v_prenex_612 Int) (v_max_~ret~0_BEFORE_RETURN_84 Int) (v_max_~ret~0_BEFORE_RETURN_83 Int)) (or (and (= (+ (mod v_prenex_612 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_612 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (<= (mod v_prenex_611 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_prenex_611 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (not (<= (mod v_max_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_83 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_max_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647) (= main_~ret5~0 (mod v_max_~ret~0_BEFORE_RETURN_84 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))))) (not (= main_~ret~1 main_~ret5~0))) (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_611 Int) (v_prenex_612 Int) (v_max_~ret~0_BEFORE_RETURN_84 Int) (v_max_~ret~0_BEFORE_RETURN_83 Int)) (or (and (= (+ (mod v_prenex_612 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_612 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (<= (mod v_prenex_611 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_prenex_611 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (not (<= (mod v_max_~ret~0_BEFORE_RETURN_83 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_83 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_max_~ret~0_BEFORE_RETURN_84 4294967296) 2147483647) (= main_~ret5~0 (mod v_max_~ret~0_BEFORE_RETURN_84 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))))))) [2019-10-13 23:20:32,587 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 605#true [2019-10-13 23:20:32,587 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 591#true [2019-10-13 23:20:32,587 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 564#true [2019-10-13 23:20:32,588 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 40)) (<= 40 main_~i~1)) [2019-10-13 23:20:32,588 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 596#(exists ((v_max_~ret~0_BEFORE_RETURN_79 Int) (v_prenex_583 Int) (v_prenex_584 Int) (v_max_~ret~0_BEFORE_RETURN_80 Int)) (or (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= (+ (mod v_prenex_583 4294967296) (- 4294967296)) main_~ret~1) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_583 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (= (mod v_max_~ret~0_BEFORE_RETURN_80 4294967296) main_~ret~1) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_max_~ret~0_BEFORE_RETURN_80 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_prenex_584 4294967296) 2147483647)) (= main_~ret~1 (+ (mod v_prenex_584 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (<= (mod v_max_~ret~0_BEFORE_RETURN_79 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= (mod v_max_~ret~0_BEFORE_RETURN_79 4294967296) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:20:32,588 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:20:33,031 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:20:33,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15, 11] total 44 [2019-10-13 23:20:33,032 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761575644] [2019-10-13 23:20:33,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-13 23:20:33,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:33,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-13 23:20:33,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1545, Unknown=0, NotChecked=0, Total=1980 [2019-10-13 23:20:33,035 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 45 states. [2019-10-13 23:20:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:34,934 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2019-10-13 23:20:34,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-13 23:20:34,934 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 52 [2019-10-13 23:20:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:34,936 INFO L225 Difference]: With dead ends: 71 [2019-10-13 23:20:34,936 INFO L226 Difference]: Without dead ends: 52 [2019-10-13 23:20:34,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1333, Invalid=5807, Unknown=0, NotChecked=0, Total=7140 [2019-10-13 23:20:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-13 23:20:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-10-13 23:20:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 23:20:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2019-10-13 23:20:34,949 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 52 [2019-10-13 23:20:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:34,949 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2019-10-13 23:20:34,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-13 23:20:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2019-10-13 23:20:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-13 23:20:34,952 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:34,952 INFO L380 BasicCegarLoop]: trace histogram [26, 18, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:35,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:35,158 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:35,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1392966237, now seen corresponding path program 5 times [2019-10-13 23:20:35,160 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:35,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252778945] [2019-10-13 23:20:35,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:35,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:35,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-10-13 23:20:35,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252778945] [2019-10-13 23:20:35,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369014583] [2019-10-13 23:20:35,642 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:35,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 23:20:35,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:20:35,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 23:20:35,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-13 23:20:35,844 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2019-10-13 23:20:35,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1067387298] [2019-10-13 23:20:35,895 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:35,895 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:35,895 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:35,896 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:35,896 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:35,910 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:20:37,077 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-13 23:20:37,096 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:20:37,099 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:20:37,099 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:20:37,099 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 656#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:20:37,099 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 652#(and (not (< max_~i~0 40)) (<= 40 max_~i~0) (<= 0 max_~i~0) (= (ite (<= (mod max_~ret~0 4294967296) 2147483647) (mod max_~ret~0 4294967296) (+ (mod max_~ret~0 4294967296) (- 4294967296))) |max_#res|)) [2019-10-13 23:20:37,100 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 483#true [2019-10-13 23:20:37,100 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 526#(and (<= 39 main_~i~2) (not (< main_~i~2 39)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) [2019-10-13 23:20:37,100 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 647#(<= 0 max_~i~0) [2019-10-13 23:20:37,100 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 23:20:37,100 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 23:20:37,101 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(or (exists ((v_max_~ret~0_BEFORE_RETURN_106 Int) (v_prenex_778 Int)) (or (and (not (< main_~i~1 40)) (= |main_#t~ret6| (mod v_prenex_778 4294967296)) (<= (mod v_prenex_778 4294967296) 2147483647)) (and (not (<= (mod v_max_~ret~0_BEFORE_RETURN_106 4294967296) 2147483647)) (not (< main_~i~1 40)) (= |main_#t~ret6| (+ (mod v_max_~ret~0_BEFORE_RETURN_106 4294967296) (- 4294967296)))))) (exists ((v_prenex_777 Int) (v_max_~ret~0_BEFORE_RETURN_105 Int)) (or (and (not (<= (mod v_prenex_777 4294967296) 2147483647)) (= |main_#t~ret6| (+ (mod v_prenex_777 4294967296) (- 4294967296))) (not (< main_~i~1 40))) (and (not (< main_~i~1 40)) (<= (mod v_max_~ret~0_BEFORE_RETURN_105 4294967296) 2147483647) (= (mod v_max_~ret~0_BEFORE_RETURN_105 4294967296) |main_#t~ret6|))))) [2019-10-13 23:20:37,101 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 661#(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 23:20:37,101 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 384#true [2019-10-13 23:20:37,101 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:20:37,101 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 317#true [2019-10-13 23:20:37,102 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 238#(or (and (exists ((v_max_~ret~0_BEFORE_RETURN_109 Int) (v_prenex_806 Int) (v_prenex_805 Int) (v_max_~ret~0_BEFORE_RETURN_110 Int)) (or (and (= (+ (mod v_prenex_805 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_805 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_110 4294967296) (- 4294967296))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_110 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= (mod v_max_~ret~0_BEFORE_RETURN_109 4294967296) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= (mod v_max_~ret~0_BEFORE_RETURN_109 4294967296) 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (mod v_prenex_806 4294967296)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_806 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))))) (not (= main_~ret~1 main_~ret5~0))) (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_max_~ret~0_BEFORE_RETURN_109 Int) (v_prenex_806 Int) (v_prenex_805 Int) (v_max_~ret~0_BEFORE_RETURN_110 Int)) (or (and (= (+ (mod v_prenex_805 4294967296) (- 4294967296)) main_~ret5~0) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_805 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_110 4294967296) (- 4294967296))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_110 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= (mod v_max_~ret~0_BEFORE_RETURN_109 4294967296) main_~ret5~0) (<= main_~ret5~0 2147483647) (<= (mod v_max_~ret~0_BEFORE_RETURN_109 4294967296) 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (mod v_prenex_806 4294967296)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_prenex_806 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))))))) [2019-10-13 23:20:37,102 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 605#true [2019-10-13 23:20:37,102 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 591#true [2019-10-13 23:20:37,102 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 564#true [2019-10-13 23:20:37,102 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 40)) (<= 40 main_~i~1)) [2019-10-13 23:20:37,103 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 596#(exists ((v_max_~ret~0_BEFORE_RETURN_105 Int) (v_prenex_777 Int) (v_max_~ret~0_BEFORE_RETURN_106 Int) (v_prenex_778 Int)) (or (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= (mod v_max_~ret~0_BEFORE_RETURN_105 4294967296) 2147483647) (= (mod v_max_~ret~0_BEFORE_RETURN_105 4294967296) main_~ret~1) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_prenex_777 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~ret~1 (+ (mod v_prenex_777 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (= main_~ret~1 (+ (mod v_max_~ret~0_BEFORE_RETURN_106 4294967296) (- 4294967296))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_106 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (mod v_prenex_778 4294967296)) (<= (mod v_prenex_778 4294967296) 2147483647) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:20:37,103 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:20:37,765 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:20:37,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 4, 4, 11] total 43 [2019-10-13 23:20:37,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046006871] [2019-10-13 23:20:37,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-13 23:20:37,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-13 23:20:37,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=1443, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 23:20:37,768 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 44 states. [2019-10-13 23:20:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:39,831 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-10-13 23:20:39,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-13 23:20:39,831 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 69 [2019-10-13 23:20:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:39,832 INFO L225 Difference]: With dead ends: 76 [2019-10-13 23:20:39,832 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 23:20:39,835 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1350 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1349, Invalid=5457, Unknown=0, NotChecked=0, Total=6806 [2019-10-13 23:20:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 23:20:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-10-13 23:20:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-13 23:20:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-10-13 23:20:39,845 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 69 [2019-10-13 23:20:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:39,845 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-10-13 23:20:39,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-13 23:20:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2019-10-13 23:20:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 23:20:39,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:39,847 INFO L380 BasicCegarLoop]: trace histogram [27, 18, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:40,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:40,055 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:40,055 INFO L82 PathProgramCache]: Analyzing trace with hash -127838474, now seen corresponding path program 6 times [2019-10-13 23:20:40,055 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:40,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551055671] [2019-10-13 23:20:40,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:40,056 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:40,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-10-13 23:20:40,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551055671] [2019-10-13 23:20:40,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796262187] [2019-10-13 23:20:40,481 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:40,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 23:20:40,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:20:40,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 23:20:40,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-10-13 23:20:40,759 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-10-13 23:20:41,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [791037174] [2019-10-13 23:20:41,417 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:41,417 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:41,418 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:41,418 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:41,418 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:41,431 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:20:42,513 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-13 23:20:42,531 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:20:42,534 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:20:42,534 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:20:42,534 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 656#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:20:42,534 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 652#(and (not (< max_~i~0 40)) (<= 40 max_~i~0) (<= 0 max_~i~0) (= (ite (<= (mod max_~ret~0 4294967296) 2147483647) (mod max_~ret~0 4294967296) (+ (mod max_~ret~0 4294967296) (- 4294967296))) |max_#res|)) [2019-10-13 23:20:42,534 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 483#true [2019-10-13 23:20:42,535 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 526#(and (<= 39 main_~i~2) (not (< main_~i~2 39)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) [2019-10-13 23:20:42,535 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 647#(<= 0 max_~i~0) [2019-10-13 23:20:42,535 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 23:20:42,535 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 23:20:42,535 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(or (exists ((v_prenex_972 Int) (v_max_~ret~0_BEFORE_RETURN_132 Int)) (or (and (not (< main_~i~1 40)) (<= (mod v_max_~ret~0_BEFORE_RETURN_132 4294967296) 2147483647) (= |main_#t~ret6| (mod v_max_~ret~0_BEFORE_RETURN_132 4294967296))) (and (not (< main_~i~1 40)) (not (<= (mod v_prenex_972 4294967296) 2147483647)) (= (+ (mod v_prenex_972 4294967296) (- 4294967296)) |main_#t~ret6|)))) (exists ((v_prenex_971 Int) (v_max_~ret~0_BEFORE_RETURN_131 Int)) (or (and (<= (mod v_prenex_971 4294967296) 2147483647) (not (< main_~i~1 40)) (= (mod v_prenex_971 4294967296) |main_#t~ret6|)) (and (not (< main_~i~1 40)) (= (+ (mod v_max_~ret~0_BEFORE_RETURN_131 4294967296) (- 4294967296)) |main_#t~ret6|) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_131 4294967296) 2147483647)))))) [2019-10-13 23:20:42,535 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 661#(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 23:20:42,536 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 384#true [2019-10-13 23:20:42,536 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:20:42,536 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 317#true [2019-10-13 23:20:42,536 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 238#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_prenex_1000 Int) (v_max_~ret~0_BEFORE_RETURN_135 Int) (v_max_~ret~0_BEFORE_RETURN_136 Int) (v_prenex_999 Int)) (or (and (= main_~ret5~0 (mod v_max_~ret~0_BEFORE_RETURN_136 4294967296)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_max_~ret~0_BEFORE_RETURN_136 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (not (<= (mod v_max_~ret~0_BEFORE_RETURN_135 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_135 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= (mod v_prenex_999 4294967296) main_~ret5~0) (<= (mod v_prenex_999 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (+ (mod v_prenex_1000 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_1000 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156))))))) (and (exists ((v_prenex_1000 Int) (v_max_~ret~0_BEFORE_RETURN_135 Int) (v_max_~ret~0_BEFORE_RETURN_136 Int) (v_prenex_999 Int)) (or (and (= main_~ret5~0 (mod v_max_~ret~0_BEFORE_RETURN_136 4294967296)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (<= (mod v_max_~ret~0_BEFORE_RETURN_136 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (not (<= (mod v_max_~ret~0_BEFORE_RETURN_135 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_135 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= (mod v_prenex_999 4294967296) main_~ret5~0) (<= (mod v_prenex_999 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (+ (mod v_prenex_1000 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_prenex_1000 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:20:42,536 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 605#true [2019-10-13 23:20:42,537 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 591#true [2019-10-13 23:20:42,537 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 564#true [2019-10-13 23:20:42,537 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 40)) (<= 40 main_~i~1)) [2019-10-13 23:20:42,537 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 596#(exists ((v_prenex_972 Int) (v_prenex_971 Int) (v_max_~ret~0_BEFORE_RETURN_131 Int) (v_max_~ret~0_BEFORE_RETURN_132 Int)) (or (and (<= (mod v_prenex_971 4294967296) 2147483647) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (mod v_prenex_971 4294967296)) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_max_~ret~0_BEFORE_RETURN_131 4294967296) (- 4294967296))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_131 4294967296) 2147483647)) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_prenex_972 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~ret~1 (+ (mod v_prenex_972 4294967296) (- 4294967296))) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (= main_~ret~1 (mod v_max_~ret~0_BEFORE_RETURN_132 4294967296)) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (<= (mod v_max_~ret~0_BEFORE_RETURN_132 4294967296) 2147483647) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:20:42,537 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:20:43,124 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:20:43,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30, 11] total 53 [2019-10-13 23:20:43,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013104897] [2019-10-13 23:20:43,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-13 23:20:43,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:43,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-13 23:20:43,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=1930, Unknown=0, NotChecked=0, Total=2862 [2019-10-13 23:20:43,127 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 54 states. [2019-10-13 23:20:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:47,401 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2019-10-13 23:20:47,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-13 23:20:47,402 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 73 [2019-10-13 23:20:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:47,403 INFO L225 Difference]: With dead ends: 92 [2019-10-13 23:20:47,403 INFO L226 Difference]: Without dead ends: 69 [2019-10-13 23:20:47,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 183 SyntacticMatches, 16 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2497 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2707, Invalid=7595, Unknown=0, NotChecked=0, Total=10302 [2019-10-13 23:20:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-13 23:20:47,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-10-13 23:20:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-13 23:20:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-13 23:20:47,415 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 73 [2019-10-13 23:20:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:47,415 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-13 23:20:47,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-13 23:20:47,415 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-13 23:20:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-13 23:20:47,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:47,417 INFO L380 BasicCegarLoop]: trace histogram [40, 18, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:47,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:47,621 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash -381770835, now seen corresponding path program 7 times [2019-10-13 23:20:47,622 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:47,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728649052] [2019-10-13 23:20:47,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:47,623 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:47,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 50 proven. 71 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2019-10-13 23:20:47,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728649052] [2019-10-13 23:20:47,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620926509] [2019-10-13 23:20:47,780 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:48,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-13 23:20:48,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2019-10-13 23:20:48,031 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2019-10-13 23:20:48,118 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1085731663] [2019-10-13 23:20:48,119 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:48,119 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:48,120 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:48,120 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:48,120 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:48,138 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-13 23:20:49,250 INFO L199 IcfgInterpreter]: Interpreting procedure max with input of size 1 for LOIs [2019-10-13 23:20:49,274 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-13 23:20:49,277 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 23:20:49,277 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 23:20:49,277 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 656#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-13 23:20:49,277 INFO L193 IcfgInterpreter]: Reachable states at location maxEXIT satisfy 652#(and (not (< max_~i~0 40)) (<= 40 max_~i~0) (<= 0 max_~i~0) (= (ite (<= (mod max_~ret~0 4294967296) 2147483647) (mod max_~ret~0 4294967296) (+ (mod max_~ret~0 4294967296) (- 4294967296))) |max_#res|)) [2019-10-13 23:20:49,277 INFO L193 IcfgInterpreter]: Reachable states at location L36-1 satisfy 483#true [2019-10-13 23:20:49,278 INFO L193 IcfgInterpreter]: Reachable states at location L36 satisfy 526#(and (<= 39 main_~i~2) (not (< main_~i~2 39)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) [2019-10-13 23:20:49,278 INFO L193 IcfgInterpreter]: Reachable states at location L9-3 satisfy 647#(<= 0 max_~i~0) [2019-10-13 23:20:49,278 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 23:20:49,278 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 23:20:49,278 INFO L193 IcfgInterpreter]: Reachable states at location L27 satisfy 124#(or (exists ((v_prenex_1165 Int) (v_max_~ret~0_BEFORE_RETURN_157 Int)) (or (and (<= (mod v_prenex_1165 4294967296) 2147483647) (= |main_#t~ret6| (mod v_prenex_1165 4294967296)) (not (< main_~i~1 40))) (and (not (<= (mod v_max_~ret~0_BEFORE_RETURN_157 4294967296) 2147483647)) (not (< main_~i~1 40)) (= |main_#t~ret6| (+ (mod v_max_~ret~0_BEFORE_RETURN_157 4294967296) (- 4294967296)))))) (exists ((v_prenex_1166 Int) (v_max_~ret~0_BEFORE_RETURN_158 Int)) (or (and (<= (mod v_prenex_1166 4294967296) 2147483647) (not (< main_~i~1 40)) (= (mod v_prenex_1166 4294967296) |main_#t~ret6|)) (and (= (+ (mod v_max_~ret~0_BEFORE_RETURN_158 4294967296) (- 4294967296)) |main_#t~ret6|) (not (< main_~i~1 40)) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_158 4294967296) 2147483647)))))) [2019-10-13 23:20:49,278 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 661#(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 23:20:49,279 INFO L193 IcfgInterpreter]: Reachable states at location L38 satisfy 384#true [2019-10-13 23:20:49,279 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 23:20:49,279 INFO L193 IcfgInterpreter]: Reachable states at location L39 satisfy 317#true [2019-10-13 23:20:49,279 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 238#(or (and (not (= main_~ret~1 main_~ret2~0)) (exists ((v_max_~ret~0_BEFORE_RETURN_161 Int) (v_max_~ret~0_BEFORE_RETURN_162 Int) (v_prenex_1194 Int) (v_prenex_1193 Int)) (or (and (<= (mod v_prenex_1194 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_prenex_1194 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (not (<= (mod v_prenex_1193 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= (+ (mod v_prenex_1193 4294967296) (- 4294967296)) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_162 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_162 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= (mod v_max_~ret~0_BEFORE_RETURN_161 4294967296) main_~ret5~0) (<= (mod v_max_~ret~0_BEFORE_RETURN_161 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156))))))) (and (exists ((v_max_~ret~0_BEFORE_RETURN_161 Int) (v_max_~ret~0_BEFORE_RETURN_162 Int) (v_prenex_1194 Int) (v_prenex_1193 Int)) (or (and (<= (mod v_prenex_1194 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~ret5~0 (mod v_prenex_1194 4294967296)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (not (<= (mod v_prenex_1193 4294967296) 2147483647)) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= (+ (mod v_prenex_1193 4294967296) (- 4294967296)) main_~ret5~0) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= main_~ret5~0 (+ (mod v_max_~ret~0_BEFORE_RETURN_162 4294967296) (- 4294967296))) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_162 4294967296) 2147483647)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))) (and (= (mod v_max_~ret~0_BEFORE_RETURN_161 4294967296) main_~ret5~0) (<= (mod v_max_~ret~0_BEFORE_RETURN_161 4294967296) 2147483647) (<= main_~ret5~0 2147483647) (not (< main_~i~2 39)) (<= 0 (+ main_~ret5~0 2147483648)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 156)))))) (not (= main_~ret~1 main_~ret5~0)))) [2019-10-13 23:20:49,279 INFO L193 IcfgInterpreter]: Reachable states at location maxENTRY satisfy 605#true [2019-10-13 23:20:49,280 INFO L193 IcfgInterpreter]: Reachable states at location L30-1 satisfy 591#true [2019-10-13 23:20:49,280 INFO L193 IcfgInterpreter]: Reachable states at location L32-3 satisfy 564#true [2019-10-13 23:20:49,280 INFO L193 IcfgInterpreter]: Reachable states at location L23-4 satisfy 73#(and (not (< main_~i~1 40)) (<= 40 main_~i~1)) [2019-10-13 23:20:49,280 INFO L193 IcfgInterpreter]: Reachable states at location L30 satisfy 596#(exists ((v_prenex_1166 Int) (v_prenex_1165 Int) (v_max_~ret~0_BEFORE_RETURN_157 Int) (v_max_~ret~0_BEFORE_RETURN_158 Int)) (or (and (= main_~ret~1 (mod v_prenex_1166 4294967296)) (<= (mod v_prenex_1166 4294967296) 2147483647) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= (mod v_prenex_1165 4294967296) 2147483647) (= main_~ret~1 (mod v_prenex_1165 4294967296)) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (<= 0 (+ main_~ret~1 2147483648))) (and (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (not (<= (mod v_max_~ret~0_BEFORE_RETURN_158 4294967296) 2147483647)) (= main_~ret~1 (+ (mod v_max_~ret~0_BEFORE_RETURN_158 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))) (and (not (<= (mod v_max_~ret~0_BEFORE_RETURN_157 4294967296) 2147483647)) (<= main_~ret~1 2147483647) (not (< main_~i~1 40)) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) (+ |main_~#x~0.offset| 4))) (= main_~ret~1 (+ (mod v_max_~ret~0_BEFORE_RETURN_157 4294967296) (- 4294967296))) (<= 0 (+ main_~ret~1 2147483648))))) [2019-10-13 23:20:49,280 INFO L193 IcfgInterpreter]: Reachable states at location L23-3 satisfy 68#true [2019-10-13 23:20:49,613 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 23:20:49,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 27 [2019-10-13 23:20:49,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764114314] [2019-10-13 23:20:49,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 23:20:49,615 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:20:49,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 23:20:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2019-10-13 23:20:49,616 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 28 states. [2019-10-13 23:20:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:20:50,694 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2019-10-13 23:20:50,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-13 23:20:50,695 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 86 [2019-10-13 23:20:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:20:50,696 INFO L225 Difference]: With dead ends: 99 [2019-10-13 23:20:50,697 INFO L226 Difference]: Without dead ends: 77 [2019-10-13 23:20:50,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=543, Invalid=1907, Unknown=0, NotChecked=0, Total=2450 [2019-10-13 23:20:50,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-13 23:20:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-10-13 23:20:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-13 23:20:50,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-13 23:20:50,708 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 86 [2019-10-13 23:20:50,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:20:50,709 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-13 23:20:50,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 23:20:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-13 23:20:50,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 23:20:50,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:20:50,711 INFO L380 BasicCegarLoop]: trace histogram [42, 40, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:20:50,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:50,919 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:20:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:20:50,920 INFO L82 PathProgramCache]: Analyzing trace with hash -313171795, now seen corresponding path program 8 times [2019-10-13 23:20:50,920 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:20:50,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223614884] [2019-10-13 23:20:50,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:50,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:20:50,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:20:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:20:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 226 proven. 331 refuted. 0 times theorem prover too weak. 1269 trivial. 0 not checked. [2019-10-13 23:20:51,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223614884] [2019-10-13 23:20:51,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094401555] [2019-10-13 23:20:51,418 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:20:51,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 23:20:51,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 23:20:51,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-13 23:20:51,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:20:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 454 proven. 10 refuted. 0 times theorem prover too weak. 1362 trivial. 0 not checked. [2019-10-13 23:20:51,726 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:20:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1816 trivial. 0 not checked. [2019-10-13 23:20:51,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [684852483] [2019-10-13 23:20:51,828 INFO L162 IcfgInterpreter]: Started Sifa with 19 locations of interest [2019-10-13 23:20:51,828 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:20:51,828 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:20:51,828 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:20:51,829 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:20:51,847 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs