/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_label26.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:50:51,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:50:51,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:50:51,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:50:51,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:50:51,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:50:51,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:50:51,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:50:51,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:50:51,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:50:51,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:50:51,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:50:51,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:50:51,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:50:51,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:50:51,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:50:51,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:50:51,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:50:51,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:50:51,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:50:51,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:50:51,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:50:51,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:50:51,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:50:51,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:50:51,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:50:51,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:50:51,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:50:51,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:50:51,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:50:51,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:50:51,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:50:51,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:50:51,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:50:51,283 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:50:51,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:50:51,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:50:51,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:50:51,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:50:51,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:50:51,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:50:51,290 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:50:51,309 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:50:51,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:50:51,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:50:51,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:50:51,311 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:50:51,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:50:51,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:50:51,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:50:51,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:50:51,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:50:51,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:50:51,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:50:51,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:50:51,313 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:50:51,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:50:51,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:50:51,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:50:51,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:50:51,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:50:51,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:50:51,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:50:51,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:50:51,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:50:51,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:50:51,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:50:51,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:50:51,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:50:51,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:50:51,316 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:50:51,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:50:51,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:50:51,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:50:51,605 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:50:51,605 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:50:51,606 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label26.c [2019-11-06 22:50:51,675 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ac69ae9/16f87db0dedd4faba8f1e72271f79345/FLAGc4b427246 [2019-11-06 22:50:52,264 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:50:52,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label26.c [2019-11-06 22:50:52,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ac69ae9/16f87db0dedd4faba8f1e72271f79345/FLAGc4b427246 [2019-11-06 22:50:52,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ac69ae9/16f87db0dedd4faba8f1e72271f79345 [2019-11-06 22:50:52,513 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:50:52,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:50:52,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:50:52,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:50:52,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:50:52,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:52" (1/1) ... [2019-11-06 22:50:52,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d9e582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:52, skipping insertion in model container [2019-11-06 22:50:52,523 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:50:52" (1/1) ... [2019-11-06 22:50:52,530 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:50:52,585 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:50:53,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:50:53,127 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:50:53,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:50:53,298 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:50:53,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:53 WrapperNode [2019-11-06 22:50:53,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:50:53,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:50:53,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:50:53,300 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:50:53,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:53" (1/1) ... [2019-11-06 22:50:53,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:53" (1/1) ... [2019-11-06 22:50:53,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:53" (1/1) ... [2019-11-06 22:50:53,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:53" (1/1) ... [2019-11-06 22:50:53,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:53" (1/1) ... [2019-11-06 22:50:53,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:53" (1/1) ... [2019-11-06 22:50:53,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:53" (1/1) ... [2019-11-06 22:50:53,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:50:53,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:50:53,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:50:53,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:50:53,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:53" (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:50:53,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:50:53,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:50:53,545 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-11-06 22:50:53,545 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:50:53,545 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-11-06 22:50:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:50:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:50:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:50:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:50:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:50:53,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:50:55,118 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:50:55,119 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:50:55,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:55 BoogieIcfgContainer [2019-11-06 22:50:55,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:50:55,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:50:55,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:50:55,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:50:55,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:50:52" (1/3) ... [2019-11-06 22:50:55,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a195feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:55, skipping insertion in model container [2019-11-06 22:50:55,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:50:53" (2/3) ... [2019-11-06 22:50:55,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a195feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:50:55, skipping insertion in model container [2019-11-06 22:50:55,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:50:55" (3/3) ... [2019-11-06 22:50:55,136 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label26.c [2019-11-06 22:50:55,150 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:50:55,161 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:50:55,173 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:50:55,207 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:50:55,207 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:50:55,207 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:50:55,207 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:50:55,208 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:50:55,208 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:50:55,208 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:50:55,208 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:50:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-11-06 22:50:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-06 22:50:55,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:50:55,248 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, 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:50:55,250 INFO L410 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:50:55,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:50:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1385105165, now seen corresponding path program 1 times [2019-11-06 22:50:55,265 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:50:55,266 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028261027] [2019-11-06 22:50:55,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:50:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:50:55,642 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:50:55,643 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028261027] [2019-11-06 22:50:55,645 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:50:55,645 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:50:55,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787754509] [2019-11-06 22:50:55,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:50:55,655 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:50:55,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:50:55,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:50:55,678 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-11-06 22:50:57,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:50:57,026 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-11-06 22:50:57,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:50:57,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-06 22:50:57,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:50:57,045 INFO L225 Difference]: With dead ends: 688 [2019-11-06 22:50:57,046 INFO L226 Difference]: Without dead ends: 372 [2019-11-06 22:50:57,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:50:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-11-06 22:50:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-11-06 22:50:57,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-06 22:50:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 596 transitions. [2019-11-06 22:50:57,140 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 596 transitions. Word has length 72 [2019-11-06 22:50:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:50:57,141 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 596 transitions. [2019-11-06 22:50:57,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:50:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 596 transitions. [2019-11-06 22:50:57,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-06 22:50:57,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:50:57,149 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, 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] [2019-11-06 22:50:57,149 INFO L410 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:50:57,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:50:57,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1505037462, now seen corresponding path program 1 times [2019-11-06 22:50:57,150 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:50:57,150 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403597335] [2019-11-06 22:50:57,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:50:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:50:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:50:57,325 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403597335] [2019-11-06 22:50:57,325 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:50:57,326 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:50:57,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278048351] [2019-11-06 22:50:57,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:50:57,328 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:50:57,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:50:57,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:50:57,328 INFO L87 Difference]: Start difference. First operand 372 states and 596 transitions. Second operand 5 states. [2019-11-06 22:50:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:50:58,873 INFO L93 Difference]: Finished difference Result 940 states and 1514 transitions. [2019-11-06 22:50:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 22:50:58,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-11-06 22:50:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:50:58,879 INFO L225 Difference]: With dead ends: 940 [2019-11-06 22:50:58,879 INFO L226 Difference]: Without dead ends: 574 [2019-11-06 22:50:58,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:50:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-06 22:50:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 564. [2019-11-06 22:50:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-11-06 22:50:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 831 transitions. [2019-11-06 22:50:58,927 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 831 transitions. Word has length 148 [2019-11-06 22:50:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:50:58,928 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 831 transitions. [2019-11-06 22:50:58,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:50:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 831 transitions. [2019-11-06 22:50:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-06 22:50:58,933 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:50:58,934 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:50:58,934 INFO L410 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:50:58,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:50:58,935 INFO L82 PathProgramCache]: Analyzing trace with hash 430034666, now seen corresponding path program 1 times [2019-11-06 22:50:58,935 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:50:58,935 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790395967] [2019-11-06 22:50:58,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:50:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:50:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:50:59,272 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790395967] [2019-11-06 22:50:59,272 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:50:59,273 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 22:50:59,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813269790] [2019-11-06 22:50:59,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 22:50:59,278 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:50:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 22:50:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:50:59,279 INFO L87 Difference]: Start difference. First operand 564 states and 831 transitions. Second operand 6 states. [2019-11-06 22:51:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:51:00,630 INFO L93 Difference]: Finished difference Result 1526 states and 2378 transitions. [2019-11-06 22:51:00,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 22:51:00,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 212 [2019-11-06 22:51:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:51:00,638 INFO L225 Difference]: With dead ends: 1526 [2019-11-06 22:51:00,638 INFO L226 Difference]: Without dead ends: 968 [2019-11-06 22:51:00,641 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:51:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-11-06 22:51:00,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 942. [2019-11-06 22:51:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-11-06 22:51:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1352 transitions. [2019-11-06 22:51:00,692 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1352 transitions. Word has length 212 [2019-11-06 22:51:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:51:00,693 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 1352 transitions. [2019-11-06 22:51:00,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 22:51:00,693 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1352 transitions. [2019-11-06 22:51:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-06 22:51:00,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:51:00,707 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:51:00,707 INFO L410 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:51:00,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:00,707 INFO L82 PathProgramCache]: Analyzing trace with hash -68983624, now seen corresponding path program 1 times [2019-11-06 22:51:00,708 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:51:00,708 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117350673] [2019-11-06 22:51:00,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:51:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:00,940 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117350673] [2019-11-06 22:51:00,940 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982107527] [2019-11-06 22:51:00,940 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:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:51:01,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 22:51:01,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:51:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:01,216 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:51:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:51:01,380 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [815130436] [2019-11-06 22:51:01,387 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 232 [2019-11-06 22:51:01,447 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:51:01,447 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:51:05,769 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:51:05,771 INFO L272 AbstractInterpreter]: Visited 88 different actions 88 times. Never merged. Never widened. Performed 215 root evaluator evaluations with a maximum evaluation depth of 13. Performed 215 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:05,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:51:05,776 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:51:09,268 INFO L227 lantSequenceWeakener]: Weakened 212 states. On average, predicates are now at 78.57% of their original sizes. [2019-11-06 22:51:09,269 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:51:09,333 INFO L553 sIntCurrentIteration]: We unified 230 AI predicates to 230 [2019-11-06 22:51:09,333 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:51:09,334 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:51:09,334 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 5, 5] total 18 [2019-11-06 22:51:09,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100445272] [2019-11-06 22:51:09,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:51:09,336 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:51:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 22:51:09,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:51:09,337 INFO L87 Difference]: Start difference. First operand 942 states and 1352 transitions. Second operand 10 states. [2019-11-06 22:51:09,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:51:09,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:51:09,540 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: 5425#true or 7281#(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) (<= main_~input~0 2147483647) (<= 0 (+ main_~input~0 2147483648)) (= |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]; main_~input~0 = [-2147483648;2147483647]; ~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:51:09,551 INFO L168 Benchmark]: Toolchain (without parser) took 17032.65 ms. Allocated memory was 146.3 MB in the beginning and 904.9 MB in the end (delta: 758.6 MB). Free memory was 102.2 MB in the beginning and 699.8 MB in the end (delta: -597.6 MB). Peak memory consumption was 161.0 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:09,556 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.4 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:51:09,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.00 ms. Allocated memory was 146.3 MB in the beginning and 206.6 MB in the end (delta: 60.3 MB). Free memory was 102.0 MB in the beginning and 166.4 MB in the end (delta: -64.4 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:09,563 INFO L168 Benchmark]: Boogie Preprocessor took 163.60 ms. Allocated memory is still 206.6 MB. Free memory was 166.4 MB in the beginning and 160.8 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:09,565 INFO L168 Benchmark]: RCFGBuilder took 1656.72 ms. Allocated memory was 206.6 MB in the beginning and 237.0 MB in the end (delta: 30.4 MB). Free memory was 160.8 MB in the beginning and 151.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:09,566 INFO L168 Benchmark]: TraceAbstraction took 14423.81 ms. Allocated memory was 237.0 MB in the beginning and 904.9 MB in the end (delta: 667.9 MB). Free memory was 151.1 MB in the beginning and 699.8 MB in the end (delta: -548.7 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. [2019-11-06 22:51:09,570 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.21 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 784.00 ms. Allocated memory was 146.3 MB in the beginning and 206.6 MB in the end (delta: 60.3 MB). Free memory was 102.0 MB in the beginning and 166.4 MB in the end (delta: -64.4 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 163.60 ms. Allocated memory is still 206.6 MB. Free memory was 166.4 MB in the beginning and 160.8 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1656.72 ms. Allocated memory was 206.6 MB in the beginning and 237.0 MB in the end (delta: 30.4 MB). Free memory was 160.8 MB in the beginning and 151.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14423.81 ms. Allocated memory was 237.0 MB in the beginning and 904.9 MB in the end (delta: 667.9 MB). Free memory was 151.1 MB in the beginning and 699.8 MB in the end (delta: -548.7 MB). Peak memory consumption was 119.2 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: 5425#true or 7281#(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) (<= main_~input~0 2147483647) (<= 0 (+ main_~input~0 2147483648)) (= |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]; main_~input~0 = [-2147483648;2147483647]; ~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: 5425#true or 7281#(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) (<= main_~input~0 2147483647) (<= 0 (+ main_~input~0 2147483648)) (= |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]; main_~input~0 = [-2147483648;2147483647]; ~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...