/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/array-crafted/zero_sum_const_m2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:26:08,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:26:08,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:26:08,050 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:26:08,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:26:08,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:26:08,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:26:08,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:26:08,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:26:08,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:26:08,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:26:08,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:26:08,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:26:08,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:26:08,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:26:08,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:26:08,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:26:08,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:26:08,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:26:08,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:26:08,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:26:08,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:26:08,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:26:08,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:26:08,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:26:08,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:26:08,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:26:08,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:26:08,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:26:08,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:26:08,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:26:08,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:26:08,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:26:08,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:26:08,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:26:08,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:26:08,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:26:08,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:26:08,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:26:08,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:26:08,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:26:08,087 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-11-06 22:26:08,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:26:08,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:26:08,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:26:08,111 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:26:08,111 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:26:08,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:26:08,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:26:08,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:26:08,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:26:08,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:26:08,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:26:08,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:26:08,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:26:08,114 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:26:08,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:26:08,114 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:26:08,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:26:08,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:26:08,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:26:08,115 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:26:08,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:26:08,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:26:08,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:26:08,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:26:08,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:26:08,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:26:08,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:26:08,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:26:08,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:26:08,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:26:08,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:26:08,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:26:08,469 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:26:08,469 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:26:08,470 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_const_m2.c [2019-11-06 22:26:08,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9c69418/39cb3672981643708c405aece89be3e8/FLAG1355507d0 [2019-11-06 22:26:09,007 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:26:09,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_const_m2.c [2019-11-06 22:26:09,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9c69418/39cb3672981643708c405aece89be3e8/FLAG1355507d0 [2019-11-06 22:26:09,398 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9c69418/39cb3672981643708c405aece89be3e8 [2019-11-06 22:26:09,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:26:09,410 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:26:09,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:26:09,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:26:09,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:26:09,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:09" (1/1) ... [2019-11-06 22:26:09,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2406b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09, skipping insertion in model container [2019-11-06 22:26:09,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:09" (1/1) ... [2019-11-06 22:26:09,426 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:26:09,444 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:26:09,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:26:09,652 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:26:09,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:26:09,685 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:26:09,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09 WrapperNode [2019-11-06 22:26:09,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:26:09,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:26:09,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:26:09,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:26:09,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2019-11-06 22:26:09,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2019-11-06 22:26:09,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2019-11-06 22:26:09,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2019-11-06 22:26:09,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2019-11-06 22:26:09,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2019-11-06 22:26:09,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (1/1) ... [2019-11-06 22:26:09,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:26:09,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:26:09,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:26:09,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:26:09,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (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-11-06 22:26:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:26:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:26:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-06 22:26:09,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:26:09,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:26:09,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 22:26:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 22:26:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 22:26:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 22:26:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:26:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 22:26:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:26:09,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:26:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:26:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:26:09,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:26:10,144 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:26:10,145 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-06 22:26:10,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:10 BoogieIcfgContainer [2019-11-06 22:26:10,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:26:10,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:26:10,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:26:10,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:26:10,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:26:09" (1/3) ... [2019-11-06 22:26:10,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b07ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:10, skipping insertion in model container [2019-11-06 22:26:10,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:09" (2/3) ... [2019-11-06 22:26:10,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b07ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:10, skipping insertion in model container [2019-11-06 22:26:10,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:10" (3/3) ... [2019-11-06 22:26:10,156 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_const_m2.c [2019-11-06 22:26:10,165 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:26:10,171 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:26:10,183 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:26:10,210 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:26:10,210 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:26:10,210 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:26:10,210 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:26:10,210 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:26:10,211 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:26:10,211 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:26:10,211 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:26:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-11-06 22:26:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 22:26:10,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:26:10,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:26:10,237 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:26:10,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:26:10,242 INFO L82 PathProgramCache]: Analyzing trace with hash -720839896, now seen corresponding path program 1 times [2019-11-06 22:26:10,250 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:26:10,250 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284184001] [2019-11-06 22:26:10,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:26:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:26:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:26:10,380 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284184001] [2019-11-06 22:26:10,381 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:26:10,381 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-06 22:26:10,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59623749] [2019-11-06 22:26:10,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:26:10,387 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:26:10,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-06 22:26:10,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:26:10,405 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2019-11-06 22:26:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:26:10,431 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2019-11-06 22:26:10,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:26:10,433 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-11-06 22:26:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:26:10,442 INFO L225 Difference]: With dead ends: 57 [2019-11-06 22:26:10,443 INFO L226 Difference]: Without dead ends: 26 [2019-11-06 22:26:10,446 INFO L630 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-11-06 22:26:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-06 22:26:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-06 22:26:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-06 22:26:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-06 22:26:10,489 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2019-11-06 22:26:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:26:10,489 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-06 22:26:10,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:26:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-06 22:26:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 22:26:10,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:26:10,491 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:26:10,492 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:26:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:26:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1191176598, now seen corresponding path program 1 times [2019-11-06 22:26:10,493 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:26:10,493 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265263430] [2019-11-06 22:26:10,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:26:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:26:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:26:10,662 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265263430] [2019-11-06 22:26:10,662 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:26:10,663 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:26:10,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855673114] [2019-11-06 22:26:10,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:26:10,669 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:26:10,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:26:10,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:26:10,670 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-11-06 22:26:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:26:10,767 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-11-06 22:26:10,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:26:10,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-06 22:26:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:26:10,772 INFO L225 Difference]: With dead ends: 38 [2019-11-06 22:26:10,772 INFO L226 Difference]: Without dead ends: 33 [2019-11-06 22:26:10,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:26:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-06 22:26:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-06 22:26:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 22:26:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-11-06 22:26:10,789 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2019-11-06 22:26:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:26:10,790 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-11-06 22:26:10,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:26:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-11-06 22:26:10,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 22:26:10,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:26:10,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:26:10,793 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:26:10,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:26:10,795 INFO L82 PathProgramCache]: Analyzing trace with hash -988852588, now seen corresponding path program 1 times [2019-11-06 22:26:10,795 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:26:10,796 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585299236] [2019-11-06 22:26:10,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:26:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:26:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 22:26:10,891 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585299236] [2019-11-06 22:26:10,891 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:26:10,891 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:26:10,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828037877] [2019-11-06 22:26:10,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:26:10,893 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:26:10,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:26:10,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:26:10,894 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 3 states. [2019-11-06 22:26:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:26:10,958 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2019-11-06 22:26:10,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:26:10,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 22:26:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:26:10,960 INFO L225 Difference]: With dead ends: 59 [2019-11-06 22:26:10,960 INFO L226 Difference]: Without dead ends: 35 [2019-11-06 22:26:10,961 INFO L630 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-11-06 22:26:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-06 22:26:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-06 22:26:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-06 22:26:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2019-11-06 22:26:10,968 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 22 [2019-11-06 22:26:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:26:10,969 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2019-11-06 22:26:10,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:26:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2019-11-06 22:26:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 22:26:10,970 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:26:10,971 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:26:10,971 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:26:10,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:26:10,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1991586542, now seen corresponding path program 1 times [2019-11-06 22:26:10,972 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:26:10,972 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706659731] [2019-11-06 22:26:10,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:26:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:26:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 22:26:11,048 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706659731] [2019-11-06 22:26:11,049 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:26:11,049 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:26:11,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275572214] [2019-11-06 22:26:11,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:26:11,050 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:26:11,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:26:11,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:26:11,051 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2019-11-06 22:26:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:26:11,156 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-11-06 22:26:11,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:26:11,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-06 22:26:11,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:26:11,158 INFO L225 Difference]: With dead ends: 55 [2019-11-06 22:26:11,158 INFO L226 Difference]: Without dead ends: 36 [2019-11-06 22:26:11,159 INFO L630 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-11-06 22:26:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-06 22:26:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-11-06 22:26:11,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 22:26:11,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-11-06 22:26:11,167 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2019-11-06 22:26:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:26:11,167 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-11-06 22:26:11,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:26:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-11-06 22:26:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 22:26:11,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:26:11,169 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:26:11,169 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:26:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:26:11,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1169709580, now seen corresponding path program 1 times [2019-11-06 22:26:11,170 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:26:11,170 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676697929] [2019-11-06 22:26:11,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:26:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:26:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:26:11,250 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676697929] [2019-11-06 22:26:11,250 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629856912] [2019-11-06 22:26:11,250 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-11-06 22:26:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:26:11,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:26:11,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:26:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:26:11,400 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:26:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 22:26:11,442 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1718011477] [2019-11-06 22:26:11,451 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 31 [2019-11-06 22:26:11,522 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:26:11,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:26:11,622 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:26:11,624 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 3. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 32 variables. [2019-11-06 22:26:11,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:26:11,628 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:26:11,700 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-11-06 22:26:11,700 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:26:11,710 INFO L553 sIntCurrentIteration]: We unified 29 AI predicates to 29 [2019-11-06 22:26:11,710 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:26:11,712 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:26:11,712 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4, 4] total 9 [2019-11-06 22:26:11,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567510316] [2019-11-06 22:26:11,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:26:11,713 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:26:11,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:26:11,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:26:11,714 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2019-11-06 22:26:11,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:26:11,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:26:11,922 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at least one of both input predicates is unknown: 527#true or 753#(and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) ([#1{~SIZE~0 = [-2147483648;2147483647]; ~MAX~0 = [100000;100000]; }]) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker$CheckHelper.check(SdHoareTripleChecker.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.SdHoareTripleChecker.checkCall(SdHoareTripleChecker.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkCall(EfficientHoareTripleChecker.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkCall(CachingHoareTripleChecker.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$CallSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:403) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.callSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.callSuccessors(TotalizeNwa.java:260) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.callSuccessors(ComplementDeterministicNwa.java:131) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:252) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.callSuccessors(ProductNwa.java:244) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addCallsAndSuccessors(NestedWordAutomatonReachableStates.java:1089) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:969) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) 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-11-06 22:26:11,930 INFO L168 Benchmark]: Toolchain (without parser) took 2519.03 ms. Allocated memory was 137.4 MB in the beginning and 231.2 MB in the end (delta: 93.8 MB). Free memory was 102.5 MB in the beginning and 184.0 MB in the end (delta: -81.6 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:26:11,931 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:26:11,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.95 ms. Allocated memory is still 137.4 MB. Free memory was 102.3 MB in the beginning and 92.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:26:11,933 INFO L168 Benchmark]: Boogie Preprocessor took 106.76 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 92.1 MB in the beginning and 177.8 MB in the end (delta: -85.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:26:11,933 INFO L168 Benchmark]: RCFGBuilder took 353.81 ms. Allocated memory is still 199.8 MB. Free memory was 177.8 MB in the beginning and 161.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:26:11,934 INFO L168 Benchmark]: TraceAbstraction took 1779.11 ms. Allocated memory was 199.8 MB in the beginning and 231.2 MB in the end (delta: 31.5 MB). Free memory was 160.3 MB in the beginning and 184.0 MB in the end (delta: -23.7 MB). Peak memory consumption was 7.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:26:11,939 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.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 274.95 ms. Allocated memory is still 137.4 MB. Free memory was 102.3 MB in the beginning and 92.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.76 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 92.1 MB in the beginning and 177.8 MB in the end (delta: -85.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 353.81 ms. Allocated memory is still 199.8 MB. Free memory was 177.8 MB in the beginning and 161.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1779.11 ms. Allocated memory was 199.8 MB in the beginning and 231.2 MB in the end (delta: 31.5 MB). Free memory was 160.3 MB in the beginning and 184.0 MB in the end (delta: -23.7 MB). Peak memory consumption was 7.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: at least one of both input predicates is unknown: 527#true or 753#(and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) ([#1{~SIZE~0 = [-2147483648;2147483647]; ~MAX~0 = [100000;100000]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 527#true or 753#(and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) ([#1{~SIZE~0 = [-2147483648;2147483647]; ~MAX~0 = [100000;100000]; }]): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$CoverageRelation.isCovered(PredicateUnifier.java:593) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...