java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/array-examples/standard_strcpy_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 00:24:25,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 00:24:25,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 00:24:25,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 00:24:25,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 00:24:25,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 00:24:25,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 00:24:25,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 00:24:25,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 00:24:25,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 00:24:25,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 00:24:25,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 00:24:25,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 00:24:25,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 00:24:25,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 00:24:25,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 00:24:25,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 00:24:25,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 00:24:25,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 00:24:25,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 00:24:25,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 00:24:25,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 00:24:25,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 00:24:25,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 00:24:25,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 00:24:25,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 00:24:25,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 00:24:25,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 00:24:25,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 00:24:25,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 00:24:25,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 00:24:25,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 00:24:25,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 00:24:25,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 00:24:25,475 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 00:24:25,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 00:24:25,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 00:24:25,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 00:24:25,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 00:24:25,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 00:24:25,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 00:24:25,479 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-07 00:24:25,512 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 00:24:25,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 00:24:25,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 00:24:25,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 00:24:25,514 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 00:24:25,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 00:24:25,515 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 00:24:25,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 00:24:25,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 00:24:25,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 00:24:25,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 00:24:25,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 00:24:25,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 00:24:25,516 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 00:24:25,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 00:24:25,517 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 00:24:25,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 00:24:25,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 00:24:25,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 00:24:25,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 00:24:25,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 00:24:25,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 00:24:25,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 00:24:25,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 00:24:25,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 00:24:25,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 00:24:25,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 00:24:25,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 00:24:25,519 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-07 00:24:25,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 00:24:25,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 00:24:25,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 00:24:25,826 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 00:24:25,826 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 00:24:25,827 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_ground-1.i [2019-10-07 00:24:25,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702b991f7/d0427ba391fe4a0b95f0c16ea342880f/FLAGabcab50cb [2019-10-07 00:24:26,348 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 00:24:26,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcpy_ground-1.i [2019-10-07 00:24:26,356 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702b991f7/d0427ba391fe4a0b95f0c16ea342880f/FLAGabcab50cb [2019-10-07 00:24:26,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/702b991f7/d0427ba391fe4a0b95f0c16ea342880f [2019-10-07 00:24:26,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 00:24:26,759 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 00:24:26,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 00:24:26,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 00:24:26,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 00:24:26,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:24:26" (1/1) ... [2019-10-07 00:24:26,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54268d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:26, skipping insertion in model container [2019-10-07 00:24:26,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 12:24:26" (1/1) ... [2019-10-07 00:24:26,777 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 00:24:26,798 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 00:24:26,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:24:26,986 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 00:24:27,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 00:24:27,028 INFO L192 MainTranslator]: Completed translation [2019-10-07 00:24:27,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:27 WrapperNode [2019-10-07 00:24:27,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 00:24:27,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 00:24:27,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 00:24:27,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 00:24:27,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:27" (1/1) ... [2019-10-07 00:24:27,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:27" (1/1) ... [2019-10-07 00:24:27,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:27" (1/1) ... [2019-10-07 00:24:27,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:27" (1/1) ... [2019-10-07 00:24:27,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:27" (1/1) ... [2019-10-07 00:24:27,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:27" (1/1) ... [2019-10-07 00:24:27,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:27" (1/1) ... [2019-10-07 00:24:27,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 00:24:27,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 00:24:27,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 00:24:27,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 00:24:27,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:27" (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-07 00:24:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 00:24:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 00:24:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 00:24:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 00:24:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 00:24:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 00:24:27,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 00:24:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 00:24:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 00:24:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 00:24:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 00:24:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 00:24:27,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 00:24:27,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 00:24:27,582 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 00:24:27,582 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-07 00:24:27,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:24:27 BoogieIcfgContainer [2019-10-07 00:24:27,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 00:24:27,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 00:24:27,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 00:24:27,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 00:24:27,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 12:24:26" (1/3) ... [2019-10-07 00:24:27,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcf591d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:24:27, skipping insertion in model container [2019-10-07 00:24:27,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 12:24:27" (2/3) ... [2019-10-07 00:24:27,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcf591d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 12:24:27, skipping insertion in model container [2019-10-07 00:24:27,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 12:24:27" (3/3) ... [2019-10-07 00:24:27,593 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_strcpy_ground-1.i [2019-10-07 00:24:27,603 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 00:24:27,611 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 00:24:27,623 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 00:24:27,651 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 00:24:27,651 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 00:24:27,651 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 00:24:27,652 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 00:24:27,652 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 00:24:27,652 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 00:24:27,652 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 00:24:27,652 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 00:24:27,671 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-07 00:24:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 00:24:27,678 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:27,679 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:27,681 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:27,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash -397145490, now seen corresponding path program 1 times [2019-10-07 00:24:27,694 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:27,694 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:27,694 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:27,695 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:27,852 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:27,852 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:24:27,853 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-07 00:24:27,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-07 00:24:27,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-07 00:24:27,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 00:24:27,870 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-10-07 00:24:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:27,890 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2019-10-07 00:24:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-07 00:24:27,891 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-07 00:24:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:27,900 INFO L225 Difference]: With dead ends: 34 [2019-10-07 00:24:27,900 INFO L226 Difference]: Without dead ends: 18 [2019-10-07 00:24:27,903 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-07 00:24:27,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-07 00:24:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-07 00:24:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-07 00:24:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-07 00:24:27,940 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-10-07 00:24:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:27,940 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-07 00:24:27,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-07 00:24:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-07 00:24:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 00:24:27,942 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:27,942 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:27,942 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:27,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1334096934, now seen corresponding path program 1 times [2019-10-07 00:24:27,943 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:27,944 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:27,944 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:27,944 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:27,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 00:24:28,017 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:28,018 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:24:28,018 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 00:24:28,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 00:24:28,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 00:24:28,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 00:24:28,021 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 3 states. [2019-10-07 00:24:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:28,050 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-10-07 00:24:28,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 00:24:28,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-07 00:24:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:28,053 INFO L225 Difference]: With dead ends: 31 [2019-10-07 00:24:28,053 INFO L226 Difference]: Without dead ends: 19 [2019-10-07 00:24:28,055 INFO L606 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-07 00:24:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-07 00:24:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-07 00:24:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-07 00:24:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-10-07 00:24:28,060 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-10-07 00:24:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:28,061 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-10-07 00:24:28,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 00:24:28,061 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-10-07 00:24:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 00:24:28,062 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:28,062 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:28,062 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:28,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:28,063 INFO L82 PathProgramCache]: Analyzing trace with hash 980330470, now seen corresponding path program 1 times [2019-10-07 00:24:28,063 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:28,063 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:28,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:28,064 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:28,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 00:24:28,170 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:28,170 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 00:24:28,170 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 00:24:28,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 00:24:28,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 00:24:28,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:24:28,172 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2019-10-07 00:24:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:28,209 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-10-07 00:24:28,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 00:24:28,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 00:24:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:28,211 INFO L225 Difference]: With dead ends: 32 [2019-10-07 00:24:28,211 INFO L226 Difference]: Without dead ends: 21 [2019-10-07 00:24:28,212 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 00:24:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-10-07 00:24:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-10-07 00:24:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-07 00:24:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-10-07 00:24:28,218 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2019-10-07 00:24:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:28,218 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-10-07 00:24:28,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 00:24:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-10-07 00:24:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 00:24:28,220 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:28,220 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:28,220 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:28,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1869599928, now seen corresponding path program 1 times [2019-10-07 00:24:28,221 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:28,221 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:28,222 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:28,222 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:24:28,303 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:28,304 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:28,304 INFO L95 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-07 00:24:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:28,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 00:24:28,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:24:28,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:24:28,438 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 00:24:28,464 INFO L162 IcfgInterpreter]: Started Sifa with 15 locations of interest [2019-10-07 00:24:28,464 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 00:24:28,471 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 00:24:28,479 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 00:24:28,480 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 00:24:28,638 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 21 for LOIs [2019-10-07 00:24:29,104 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2019-10-07 00:24:29,130 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2019-10-07 00:24:29,142 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 00:24:29,143 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 00:24:29,143 INFO L193 IcfgInterpreter]: Reachable states at location L15-4 satisfy 132#(and (or (not (< main_~j~0 100000)) (= (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 main_~i~0) |main_~#dst~0.offset| (- 4))) (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 main_~i~0) |main_~#src~0.offset| (- 4))))) (<= 100000 main_~j~0)) [2019-10-07 00:24:29,144 INFO L193 IcfgInterpreter]: Reachable states at location L3-1 satisfy 146#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#src~0.offset_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:29,144 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 155#(and (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 00:24:29,144 INFO L193 IcfgInterpreter]: Reachable states at location L15-2 satisfy 111#(<= 100000 main_~j~0) [2019-10-07 00:24:29,144 INFO L193 IcfgInterpreter]: Reachable states at location L3 satisfy 141#(and (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#src~0.offset_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|)))))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:29,145 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-07 00:24:29,145 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-07 00:24:29,145 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 160#(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-07 00:24:29,146 INFO L193 IcfgInterpreter]: Reachable states at location L20-3 satisfy 121#(and (= main_~x~0 0) (<= 100000 main_~j~0) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:24:29,146 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 00:24:29,146 INFO L193 IcfgInterpreter]: Reachable states at location L10-2 satisfy 68#true [2019-10-07 00:24:29,147 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 136#(exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#src~0.offset_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|)))))) [2019-10-07 00:24:29,148 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 151#(and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_4 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int) (|v_main_~#dst~0.offset_BEFORE_CALL_1| Int) (|v_main_~#src~0.base_BEFORE_CALL_1| Int) (|v_main_~#src~0.offset_BEFORE_CALL_1| Int) (|v_main_~#dst~0.base_BEFORE_CALL_1| Int)) (or (and (= |__VERIFIER_assert_#in~cond| 1) (= (select (select |#memory_int| v_prenex_2) v_prenex_3) (select (select |#memory_int| v_prenex_4) v_prenex_1))) (and (= |__VERIFIER_assert_#in~cond| 0) (not (= (select (select |#memory_int| |v_main_~#src~0.base_BEFORE_CALL_1|) |v_main_~#src~0.offset_BEFORE_CALL_1|) (select (select |#memory_int| |v_main_~#dst~0.base_BEFORE_CALL_1|) |v_main_~#dst~0.offset_BEFORE_CALL_1|)))))) (<= 0 __VERIFIER_assert_~cond) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2019-10-07 00:24:29,148 INFO L193 IcfgInterpreter]: Reachable states at location L15-5 satisfy 116#(<= 100000 main_~j~0) [2019-10-07 00:24:29,149 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 126#(and (<= 0 main_~i~0) (= main_~x~0 0) (= |main_#t~mem5| (select (select |#memory_int| |main_~#dst~0.base|) (+ (* 4 main_~x~0) |main_~#dst~0.offset|))) (<= 100000 main_~j~0) (< main_~x~0 main_~i~0) (= (select (select |#memory_int| |main_~#src~0.base|) (+ (* 4 main_~x~0) |main_~#src~0.offset|)) |main_#t~mem6|) (<= main_~x~0 0) (<= 0 main_~x~0)) [2019-10-07 00:24:29,511 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 00:24:29,511 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 11] total 17 [2019-10-07 00:24:29,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-07 00:24:29,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-07 00:24:29,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-07 00:24:29,518 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 17 states. [2019-10-07 00:24:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 00:24:30,147 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-10-07 00:24:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-07 00:24:30,148 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-10-07 00:24:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 00:24:30,149 INFO L225 Difference]: With dead ends: 47 [2019-10-07 00:24:30,150 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 00:24:30,152 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-10-07 00:24:30,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 00:24:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-10-07 00:24:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-07 00:24:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-07 00:24:30,163 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-10-07 00:24:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 00:24:30,163 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-07 00:24:30,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-07 00:24:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-07 00:24:30,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 00:24:30,165 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 00:24:30,165 INFO L385 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 00:24:30,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:30,376 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 00:24:30,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 00:24:30,376 INFO L82 PathProgramCache]: Analyzing trace with hash 407056044, now seen corresponding path program 2 times [2019-10-07 00:24:30,376 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 00:24:30,376 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:30,377 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:30,377 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 00:24:30,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 00:24:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 00:24:30,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-07 00:24:30,516 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 00:24:30,516 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 00:24:30,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:30,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 00:24:30,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 00:24:30,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 00:24:30,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 00:24:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 00:24:30,739 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 00:24:31,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 00:24:31,013 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:99) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:287) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-07 00:24:31,019 INFO L168 Benchmark]: Toolchain (without parser) took 4259.29 ms. Allocated memory was 145.8 MB in the beginning and 244.8 MB in the end (delta: 99.1 MB). Free memory was 104.0 MB in the beginning and 158.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-10-07 00:24:31,020 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-10-07 00:24:31,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.87 ms. Allocated memory is still 145.8 MB. Free memory was 103.6 MB in the beginning and 93.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-07 00:24:31,021 INFO L168 Benchmark]: Boogie Preprocessor took 127.01 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 93.6 MB in the beginning and 181.2 MB in the end (delta: -87.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-10-07 00:24:31,022 INFO L168 Benchmark]: RCFGBuilder took 427.33 ms. Allocated memory is still 203.9 MB. Free memory was 181.2 MB in the beginning and 162.8 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2019-10-07 00:24:31,023 INFO L168 Benchmark]: TraceAbstraction took 3431.34 ms. Allocated memory was 203.9 MB in the beginning and 244.8 MB in the end (delta: 40.9 MB). Free memory was 162.8 MB in the beginning and 158.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2019-10-07 00:24:31,027 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 121.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 268.87 ms. Allocated memory is still 145.8 MB. Free memory was 103.6 MB in the beginning and 93.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.01 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 93.6 MB in the beginning and 181.2 MB in the end (delta: -87.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.33 ms. Allocated memory is still 203.9 MB. Free memory was 181.2 MB in the beginning and 162.8 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3431.34 ms. Allocated memory was 203.9 MB in the beginning and 244.8 MB in the end (delta: 40.9 MB). Free memory was 162.8 MB in the beginning and 158.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...