/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/eca-rers2012/Problem14_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:51:29,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:51:29,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:51:29,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:51:29,361 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:51:29,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:51:29,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:51:29,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:51:29,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:51:29,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:51:29,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:51:29,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:51:29,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:51:29,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:51:29,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:51:29,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:51:29,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:51:29,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:51:29,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:51:29,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:51:29,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:51:29,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:51:29,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:51:29,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:51:29,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:51:29,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:51:29,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:51:29,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:51:29,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:51:29,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:51:29,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:51:29,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:51:29,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:51:29,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:51:29,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:51:29,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:51:29,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:51:29,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:51:29,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:51:29,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:51:29,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:51:29,409 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:51:29,422 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:51:29,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:51:29,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:51:29,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:51:29,424 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:51:29,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:51:29,424 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:51:29,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:51:29,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:51:29,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:51:29,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:51:29,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:51:29,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:51:29,426 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:51:29,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:51:29,426 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:51:29,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:51:29,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:51:29,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:51:29,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:51:29,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:51:29,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:51:29,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:51:29,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:51:29,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:51:29,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:51:29,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:51:29,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:51:29,428 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:51:29,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:51:29,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:51:29,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:51:29,725 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:51:29,726 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:51:29,726 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label45.c [2019-11-06 22:51:29,786 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e363f5c2/80cde117a80f4689bddd7c5727206bdf/FLAGb4fb6aecc [2019-11-06 22:51:30,363 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:51:30,364 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label45.c [2019-11-06 22:51:30,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e363f5c2/80cde117a80f4689bddd7c5727206bdf/FLAGb4fb6aecc [2019-11-06 22:51:30,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e363f5c2/80cde117a80f4689bddd7c5727206bdf [2019-11-06 22:51:30,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:51:30,664 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:51:30,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:51:30,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:51:30,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:51:30,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:30" (1/1) ... [2019-11-06 22:51:30,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1816c29f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:30, skipping insertion in model container [2019-11-06 22:51:30,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:30" (1/1) ... [2019-11-06 22:51:30,684 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:51:30,746 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:51:31,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:51:31,308 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:51:31,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:51:31,488 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:51:31,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:31 WrapperNode [2019-11-06 22:51:31,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:51:31,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:51:31,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:51:31,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:51:31,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:31" (1/1) ... [2019-11-06 22:51:31,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:31" (1/1) ... [2019-11-06 22:51:31,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:31" (1/1) ... [2019-11-06 22:51:31,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:31" (1/1) ... [2019-11-06 22:51:31,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:31" (1/1) ... [2019-11-06 22:51:31,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:31" (1/1) ... [2019-11-06 22:51:31,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:31" (1/1) ... [2019-11-06 22:51:31,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:51:31,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:51:31,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:51:31,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:51:31,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:31" (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:51:31,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:51:31,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:51:31,722 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:51:31,722 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:51:31,722 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:51:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:51:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:51:31,724 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:51:31,724 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:51:31,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:51:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:51:33,231 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:51:33,231 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:51:33,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:33 BoogieIcfgContainer [2019-11-06 22:51:33,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:51:33,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:51:33,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:51:33,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:51:33,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:30" (1/3) ... [2019-11-06 22:51:33,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf5c0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:33, skipping insertion in model container [2019-11-06 22:51:33,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:31" (2/3) ... [2019-11-06 22:51:33,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf5c0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:33, skipping insertion in model container [2019-11-06 22:51:33,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:33" (3/3) ... [2019-11-06 22:51:33,251 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label45.c [2019-11-06 22:51:33,266 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:51:33,275 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:51:33,287 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:51:33,330 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:51:33,330 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:51:33,330 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:51:33,331 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:51:33,331 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:51:33,331 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:51:33,331 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:51:33,331 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:51:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-11-06 22:51:33,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 22:51:33,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:33,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:33,376 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:33,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1020079963, now seen corresponding path program 1 times [2019-11-06 22:51:33,394 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:33,394 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925905538] [2019-11-06 22:51:33,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:33,791 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:51:33,792 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925905538] [2019-11-06 22:51:33,793 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:33,793 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:51:33,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840881866] [2019-11-06 22:51:33,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:51:33,803 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:33,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:51:33,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:33,821 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2019-11-06 22:51:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:35,911 INFO L93 Difference]: Finished difference Result 890 states and 1606 transitions. [2019-11-06 22:51:35,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:51:35,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-06 22:51:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:35,937 INFO L225 Difference]: With dead ends: 890 [2019-11-06 22:51:35,937 INFO L226 Difference]: Without dead ends: 554 [2019-11-06 22:51:35,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:51:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-11-06 22:51:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 372. [2019-11-06 22:51:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-06 22:51:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 524 transitions. [2019-11-06 22:51:36,022 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 524 transitions. Word has length 42 [2019-11-06 22:51:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:36,023 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 524 transitions. [2019-11-06 22:51:36,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:51:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 524 transitions. [2019-11-06 22:51:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-06 22:51:36,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:36,029 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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:51:36,030 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:36,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:36,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2050989129, now seen corresponding path program 1 times [2019-11-06 22:51:36,030 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:36,031 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127017884] [2019-11-06 22:51:36,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:36,247 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127017884] [2019-11-06 22:51:36,247 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:36,247 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:51:36,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453900976] [2019-11-06 22:51:36,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:51:36,250 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:36,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:51:36,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:36,251 INFO L87 Difference]: Start difference. First operand 372 states and 524 transitions. Second operand 4 states. [2019-11-06 22:51:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:37,802 INFO L93 Difference]: Finished difference Result 1466 states and 2091 transitions. [2019-11-06 22:51:37,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:51:37,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-11-06 22:51:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:37,808 INFO L225 Difference]: With dead ends: 1466 [2019-11-06 22:51:37,809 INFO L226 Difference]: Without dead ends: 736 [2019-11-06 22:51:37,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:51:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-11-06 22:51:37,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 554. [2019-11-06 22:51:37,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-11-06 22:51:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 809 transitions. [2019-11-06 22:51:37,848 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 809 transitions. Word has length 125 [2019-11-06 22:51:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:37,848 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 809 transitions. [2019-11-06 22:51:37,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:51:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 809 transitions. [2019-11-06 22:51:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-06 22:51:37,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:37,855 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:37,855 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:37,856 INFO L82 PathProgramCache]: Analyzing trace with hash 488627185, now seen corresponding path program 1 times [2019-11-06 22:51:37,856 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:37,856 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569490700] [2019-11-06 22:51:37,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:38,013 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569490700] [2019-11-06 22:51:38,014 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:51:38,014 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:51:38,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35376418] [2019-11-06 22:51:38,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:51:38,018 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:38,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:51:38,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:51:38,019 INFO L87 Difference]: Start difference. First operand 554 states and 809 transitions. Second operand 4 states. [2019-11-06 22:51:39,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:39,371 INFO L93 Difference]: Finished difference Result 2194 states and 3264 transitions. [2019-11-06 22:51:39,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:51:39,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-06 22:51:39,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:39,390 INFO L225 Difference]: With dead ends: 2194 [2019-11-06 22:51:39,391 INFO L226 Difference]: Without dead ends: 1646 [2019-11-06 22:51:39,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:51:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-11-06 22:51:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2019-11-06 22:51:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-11-06 22:51:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2286 transitions. [2019-11-06 22:51:39,478 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2286 transitions. Word has length 137 [2019-11-06 22:51:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:39,487 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 2286 transitions. [2019-11-06 22:51:39,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:51:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2286 transitions. [2019-11-06 22:51:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-11-06 22:51:39,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:39,507 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-06 22:51:39,508 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:39,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:39,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1957605909, now seen corresponding path program 1 times [2019-11-06 22:51:39,509 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:39,512 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426016979] [2019-11-06 22:51:39,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:39,923 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426016979] [2019-11-06 22:51:39,923 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243955421] [2019-11-06 22:51:39,923 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:51:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:40,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:51:40,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:40,238 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 163 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:40,403 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [2031900080] [2019-11-06 22:51:40,410 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 257 [2019-11-06 22:51:40,462 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:51:40,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:51:51,253 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:51:51,258 INFO L272 AbstractInterpreter]: Visited 124 different actions 124 times. Never merged. Never widened. Performed 287 root evaluator evaluations with a maximum evaluation depth of 13. Performed 287 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Never found a fixpoint. Largest state had 24 variables. [2019-11-06 22:51:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:51,263 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:52:00,455 INFO L227 lantSequenceWeakener]: Weakened 237 states. On average, predicates are now at 77.85% of their original sizes. [2019-11-06 22:52:00,455 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:52:00,541 INFO L553 sIntCurrentIteration]: We unified 255 AI predicates to 255 [2019-11-06 22:52:00,541 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:52:00,542 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:52:00,542 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 5, 5] total 20 [2019-11-06 22:52:00,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625859180] [2019-11-06 22:52:00,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 22:52:00,544 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:52:00,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-06 22:52:00,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:52:00,544 INFO L87 Difference]: Start difference. First operand 1646 states and 2286 transitions. Second operand 11 states. [2019-11-06 22:52:00,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:52:00,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:52:00,753 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: 7529#true or 9584#(and (= ~inputF~0 6) (= ~inputA~0 1) (= ~inputC~0 3) (= |old(~a15~0)| 8) (= |old(~inputA~0)| 1) (= ~a15~0 8) (= (+ main_~output~0 1) 0) (= ~inputD~0 4) (= |old(~a21~0)| 7) (= (+ |old(~a12~0)| 49) 0) (= |old(~inputE~0)| 5) (= |old(~inputB~0)| 2) (= |old(~inputF~0)| 6) (= |old(~inputC~0)| 3) (= (+ ~a12~0 49) 0) (= ~inputB~0 2) (= ~a24~0 1) (= ~inputE~0 5) (= |old(~inputD~0)| 4) (= ~a21~0 7) (= |old(~a24~0)| 1)) ([#1{~inputA~0 = [1;1]; old(~inputA~0) = [1;1]; ~a21~0 = [7;7]; old(~a21~0) = [7;7]; ~inputB~0 = [2;2]; old(~inputB~0) = [2;2]; ~inputC~0 = [3;3]; old(~inputC~0) = [3;3]; ~inputF~0 = [6;6]; old(~inputF~0) = [6;6]; ~a12~0 = [-49;-49]; old(~a12~0) = [-49;-49]; ~a15~0 = [8;8]; old(~a15~0) = [8;8]; ~inputD~0 = [4;4]; old(~inputD~0) = [4;4]; ~inputE~0 = [5;5]; old(~inputE~0) = [5;5]; ~a24~0 = [1;1]; old(~a24~0) = [1;1]; main_~output~0 = [-1;-1]; }]) 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:52:00,761 INFO L168 Benchmark]: Toolchain (without parser) took 30096.11 ms. Allocated memory was 145.8 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 101.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 170.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:00,762 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 22:52:00,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.27 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 101.5 MB in the beginning and 165.0 MB in the end (delta: -63.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:00,769 INFO L168 Benchmark]: Boogie Preprocessor took 160.17 ms. Allocated memory is still 205.0 MB. Free memory was 165.0 MB in the beginning and 159.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:00,770 INFO L168 Benchmark]: RCFGBuilder took 1583.84 ms. Allocated memory was 205.0 MB in the beginning and 237.5 MB in the end (delta: 32.5 MB). Free memory was 159.1 MB in the beginning and 150.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:00,772 INFO L168 Benchmark]: TraceAbstraction took 27523.11 ms. Allocated memory was 237.5 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 150.3 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 127.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:52:00,780 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 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.27 ms. Allocated memory was 145.8 MB in the beginning and 205.0 MB in the end (delta: 59.2 MB). Free memory was 101.5 MB in the beginning and 165.0 MB in the end (delta: -63.5 MB). Peak memory consumption was 31.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 160.17 ms. Allocated memory is still 205.0 MB. Free memory was 165.0 MB in the beginning and 159.1 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1583.84 ms. Allocated memory was 205.0 MB in the beginning and 237.5 MB in the end (delta: 32.5 MB). Free memory was 159.1 MB in the beginning and 150.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 75.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27523.11 ms. Allocated memory was 237.5 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 150.3 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 127.7 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: 7529#true or 9584#(and (= ~inputF~0 6) (= ~inputA~0 1) (= ~inputC~0 3) (= |old(~a15~0)| 8) (= |old(~inputA~0)| 1) (= ~a15~0 8) (= (+ main_~output~0 1) 0) (= ~inputD~0 4) (= |old(~a21~0)| 7) (= (+ |old(~a12~0)| 49) 0) (= |old(~inputE~0)| 5) (= |old(~inputB~0)| 2) (= |old(~inputF~0)| 6) (= |old(~inputC~0)| 3) (= (+ ~a12~0 49) 0) (= ~inputB~0 2) (= ~a24~0 1) (= ~inputE~0 5) (= |old(~inputD~0)| 4) (= ~a21~0 7) (= |old(~a24~0)| 1)) ([#1{~inputA~0 = [1;1]; old(~inputA~0) = [1;1]; ~a21~0 = [7;7]; old(~a21~0) = [7;7]; ~inputB~0 = [2;2]; old(~inputB~0) = [2;2]; ~inputC~0 = [3;3]; old(~inputC~0) = [3;3]; ~inputF~0 = [6;6]; old(~inputF~0) = [6;6]; ~a12~0 = [-49;-49]; old(~a12~0) = [-49;-49]; ~a15~0 = [8;8]; old(~a15~0) = [8;8]; ~inputD~0 = [4;4]; old(~inputD~0) = [4;4]; ~inputE~0 = [5;5]; old(~inputE~0) = [5;5]; ~a24~0 = [1;1]; old(~a24~0) = [1;1]; main_~output~0 = [-1;-1]; }]) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at least one of both input predicates is unknown: 7529#true or 9584#(and (= ~inputF~0 6) (= ~inputA~0 1) (= ~inputC~0 3) (= |old(~a15~0)| 8) (= |old(~inputA~0)| 1) (= ~a15~0 8) (= (+ main_~output~0 1) 0) (= ~inputD~0 4) (= |old(~a21~0)| 7) (= (+ |old(~a12~0)| 49) 0) (= |old(~inputE~0)| 5) (= |old(~inputB~0)| 2) (= |old(~inputF~0)| 6) (= |old(~inputC~0)| 3) (= (+ ~a12~0 49) 0) (= ~inputB~0 2) (= ~a24~0 1) (= ~inputE~0 5) (= |old(~inputD~0)| 4) (= ~a21~0 7) (= |old(~a24~0)| 1)) ([#1{~inputA~0 = [1;1]; old(~inputA~0) = [1;1]; ~a21~0 = [7;7]; old(~a21~0) = [7;7]; ~inputB~0 = [2;2]; old(~inputB~0) = [2;2]; ~inputC~0 = [3;3]; old(~inputC~0) = [3;3]; ~inputF~0 = [6;6]; old(~inputF~0) = [6;6]; ~a12~0 = [-49;-49]; old(~a12~0) = [-49;-49]; ~a15~0 = [8;8]; old(~a15~0) = [8;8]; ~inputD~0 = [4;4]; old(~inputD~0) = [4;4]; ~inputE~0 = [5;5]; old(~inputE~0) = [5;5]; ~a24~0 = [1;1]; old(~a24~0) = [1;1]; main_~output~0 = [-1;-1]; }]): 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...