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/locks/test_locks_14-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:04:13,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:04:13,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:04:13,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:04:13,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:04:13,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:04:13,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:04:13,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:04:13,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:04:13,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:04:13,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:04:13,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:04:13,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:04:13,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:04:13,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:04:13,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:04:13,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:04:13,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:04:13,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:04:13,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:04:13,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:04:13,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:04:13,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:04:13,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:04:13,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:04:13,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:04:13,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:04:13,339 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:04:13,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:04:13,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:04:13,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:04:13,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:04:13,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:04:13,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:04:13,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:04:13,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:04:13,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:04:13,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:04:13,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:04:13,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:04:13,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:04:13,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:04:13,383 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:04:13,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:04:13,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:04:13,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:04:13,388 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:04:13,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:04:13,388 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:04:13,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:04:13,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:04:13,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:04:13,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:04:13,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:04:13,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:04:13,391 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:04:13,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:04:13,392 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:04:13,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:04:13,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:04:13,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:04:13,395 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:04:13,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:04:13,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:13,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:04:13,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:04:13,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:04:13,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:04:13,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:04:13,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:04:13,399 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-10-15 01:04:13,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:04:13,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:04:13,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:04:13,711 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:04:13,712 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:04:13,713 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-2.c [2019-10-15 01:04:13,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3320d5a9c/ba79d428dc8d456586192ed98ca1db94/FLAG857503144 [2019-10-15 01:04:14,289 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:04:14,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-2.c [2019-10-15 01:04:14,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3320d5a9c/ba79d428dc8d456586192ed98ca1db94/FLAG857503144 [2019-10-15 01:04:14,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3320d5a9c/ba79d428dc8d456586192ed98ca1db94 [2019-10-15 01:04:14,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:04:14,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:04:14,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:14,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:04:14,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:04:14,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa87bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:14, skipping insertion in model container [2019-10-15 01:04:14,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:04:14" (1/1) ... [2019-10-15 01:04:14,679 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:04:14,716 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:04:14,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:14,985 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:04:15,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:04:15,142 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:04:15,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15 WrapperNode [2019-10-15 01:04:15,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:04:15,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:04:15,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:04:15,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:04:15,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... [2019-10-15 01:04:15,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:04:15,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:04:15,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:04:15,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:04:15,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:04:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:04:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:04:15,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:04:15,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:04:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:04:15,254 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:04:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:04:15,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:04:15,656 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:04:15,657 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 01:04:15,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:15 BoogieIcfgContainer [2019-10-15 01:04:15,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:04:15,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:04:15,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:04:15,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:04:15,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:04:14" (1/3) ... [2019-10-15 01:04:15,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671eb898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:15, skipping insertion in model container [2019-10-15 01:04:15,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:04:15" (2/3) ... [2019-10-15 01:04:15,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671eb898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:04:15, skipping insertion in model container [2019-10-15 01:04:15,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:04:15" (3/3) ... [2019-10-15 01:04:15,667 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-2.c [2019-10-15 01:04:15,677 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:04:15,685 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:04:15,697 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:04:15,723 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:04:15,723 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:04:15,723 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:04:15,724 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:04:15,724 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:04:15,724 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:04:15,724 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:04:15,725 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:04:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-10-15 01:04:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:15,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:15,752 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:15,753 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:15,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:15,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1694527455, now seen corresponding path program 1 times [2019-10-15 01:04:15,767 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:15,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254457768] [2019-10-15 01:04:15,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,768 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:15,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,002 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254457768] [2019-10-15 01:04:16,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945911267] [2019-10-15 01:04:16,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,032 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-10-15 01:04:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,147 INFO L93 Difference]: Finished difference Result 155 states and 287 transitions. [2019-10-15 01:04:16,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,169 INFO L225 Difference]: With dead ends: 155 [2019-10-15 01:04:16,169 INFO L226 Difference]: Without dead ends: 96 [2019-10-15 01:04:16,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-15 01:04:16,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-10-15 01:04:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-15 01:04:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 174 transitions. [2019-10-15 01:04:16,264 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 174 transitions. Word has length 24 [2019-10-15 01:04:16,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,265 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 174 transitions. [2019-10-15 01:04:16,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,265 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 174 transitions. [2019-10-15 01:04:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:16,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,269 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,270 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2019-10-15 01:04:16,272 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087280753] [2019-10-15 01:04:16,273 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,274 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087280753] [2019-10-15 01:04:16,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838050681] [2019-10-15 01:04:16,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,374 INFO L87 Difference]: Start difference. First operand 94 states and 174 transitions. Second operand 3 states. [2019-10-15 01:04:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,403 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2019-10-15 01:04:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,406 INFO L225 Difference]: With dead ends: 97 [2019-10-15 01:04:16,406 INFO L226 Difference]: Without dead ends: 95 [2019-10-15 01:04:16,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-15 01:04:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-10-15 01:04:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-15 01:04:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 175 transitions. [2019-10-15 01:04:16,418 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 175 transitions. Word has length 24 [2019-10-15 01:04:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,419 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 175 transitions. [2019-10-15 01:04:16,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 175 transitions. [2019-10-15 01:04:16,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:16,420 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,421 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,421 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash 106179553, now seen corresponding path program 1 times [2019-10-15 01:04:16,422 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434393475] [2019-10-15 01:04:16,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434393475] [2019-10-15 01:04:16,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334346726] [2019-10-15 01:04:16,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,486 INFO L87 Difference]: Start difference. First operand 95 states and 175 transitions. Second operand 3 states. [2019-10-15 01:04:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,532 INFO L93 Difference]: Finished difference Result 222 states and 412 transitions. [2019-10-15 01:04:16,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,539 INFO L225 Difference]: With dead ends: 222 [2019-10-15 01:04:16,539 INFO L226 Difference]: Without dead ends: 132 [2019-10-15 01:04:16,540 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-15 01:04:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-10-15 01:04:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-15 01:04:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 237 transitions. [2019-10-15 01:04:16,554 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 237 transitions. Word has length 24 [2019-10-15 01:04:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,554 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 237 transitions. [2019-10-15 01:04:16,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 237 transitions. [2019-10-15 01:04:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:16,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,557 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,558 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2019-10-15 01:04:16,560 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107390056] [2019-10-15 01:04:16,561 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,562 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:04:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:04:16,648 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107390056] [2019-10-15 01:04:16,649 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:04:16,649 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:04:16,649 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403468322] [2019-10-15 01:04:16,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:04:16,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:04:16,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:04:16,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,653 INFO L87 Difference]: Start difference. First operand 130 states and 237 transitions. Second operand 3 states. [2019-10-15 01:04:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:04:16,681 INFO L93 Difference]: Finished difference Result 179 states and 322 transitions. [2019-10-15 01:04:16,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:04:16,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-15 01:04:16,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:04:16,683 INFO L225 Difference]: With dead ends: 179 [2019-10-15 01:04:16,683 INFO L226 Difference]: Without dead ends: 130 [2019-10-15 01:04:16,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:04:16,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-15 01:04:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2019-10-15 01:04:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-15 01:04:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 230 transitions. [2019-10-15 01:04:16,695 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 230 transitions. Word has length 24 [2019-10-15 01:04:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:04:16,696 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 230 transitions. [2019-10-15 01:04:16,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:04:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 230 transitions. [2019-10-15 01:04:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-15 01:04:16,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:04:16,698 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:04:16,698 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:04:16,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:04:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash -914888801, now seen corresponding path program 1 times [2019-10-15 01:04:16,699 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:04:16,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982157989] [2019-10-15 01:04:16,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:04:16,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:04:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-15 01:04:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-15 01:04:16,790 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-15 01:04:16,791 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-15 01:04:16,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:04:16 BoogieIcfgContainer [2019-10-15 01:04:16,869 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:04:16,871 INFO L168 Benchmark]: Toolchain (without parser) took 2209.06 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 103.5 MB in the beginning and 97.5 MB in the end (delta: 6.0 MB). Peak memory consumption was 62.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:16,872 INFO L168 Benchmark]: CDTParser took 1.26 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:04:16,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.49 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 103.3 MB in the beginning and 181.3 MB in the end (delta: -78.0 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:16,875 INFO L168 Benchmark]: Boogie Preprocessor took 43.78 ms. Allocated memory is still 202.9 MB. Free memory was 181.3 MB in the beginning and 179.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:16,876 INFO L168 Benchmark]: RCFGBuilder took 470.97 ms. Allocated memory is still 202.9 MB. Free memory was 179.4 MB in the beginning and 156.6 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:16,876 INFO L168 Benchmark]: TraceAbstraction took 1209.23 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 97.5 MB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:04:16,881 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.26 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 480.49 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 103.3 MB in the beginning and 181.3 MB in the end (delta: -78.0 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.78 ms. Allocated memory is still 202.9 MB. Free memory was 181.3 MB in the beginning and 179.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 470.97 ms. Allocated memory is still 202.9 MB. Free memory was 179.4 MB in the beginning and 156.6 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1209.23 ms. Allocated memory is still 202.9 MB. Free memory was 156.6 MB in the beginning and 97.5 MB in the end (delta: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 217]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L6] int p1 = __VERIFIER_nondet_int(); [L7] int lk1; [L9] int p2 = __VERIFIER_nondet_int(); [L10] int lk2; [L12] int p3 = __VERIFIER_nondet_int(); [L13] int lk3; [L15] int p4 = __VERIFIER_nondet_int(); [L16] int lk4; [L18] int p5 = __VERIFIER_nondet_int(); [L19] int lk5; [L21] int p6 = __VERIFIER_nondet_int(); [L22] int lk6; [L24] int p7 = __VERIFIER_nondet_int(); [L25] int lk7; [L27] int p8 = __VERIFIER_nondet_int(); [L28] int lk8; [L30] int p9 = __VERIFIER_nondet_int(); [L31] int lk9; [L33] int p10 = __VERIFIER_nondet_int(); [L34] int lk10; [L36] int p11 = __VERIFIER_nondet_int(); [L37] int lk11; [L39] int p12 = __VERIFIER_nondet_int(); [L40] int lk12; [L42] int p13 = __VERIFIER_nondet_int(); [L43] int lk13; [L45] int p14 = __VERIFIER_nondet_int(); [L46] int lk14; [L49] int cond; VAL [p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L51] COND TRUE 1 [L52] cond = __VERIFIER_nondet_int() [L53] COND FALSE !(cond == 0) [L56] lk1 = 0 [L58] lk2 = 0 [L60] lk3 = 0 [L62] lk4 = 0 [L64] lk5 = 0 [L66] lk6 = 0 [L68] lk7 = 0 [L70] lk8 = 0 [L72] lk9 = 0 [L74] lk10 = 0 [L76] lk11 = 0 [L78] lk12 = 0 [L80] lk13 = 0 [L82] lk14 = 0 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L86] COND FALSE !(p1 != 0) VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L90] COND FALSE !(p2 != 0) VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=0, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L94] COND TRUE p3 != 0 [L95] lk3 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=0, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L98] COND TRUE p4 != 0 [L99] lk4 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=0, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L102] COND TRUE p5 != 0 [L103] lk5 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=0, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L106] COND TRUE p6 != 0 [L107] lk6 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=0, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L110] COND TRUE p7 != 0 [L111] lk7 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L114] COND FALSE !(p8 != 0) VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=0, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L118] COND TRUE p9 != 0 [L119] lk9 = 1 VAL [cond=3, lk1=0, lk10=0, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L122] COND TRUE p10 != 0 [L123] lk10 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=0, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L126] COND TRUE p11 != 0 [L127] lk11 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=0, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L130] COND TRUE p12 != 0 [L131] lk12 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=0, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L134] COND TRUE p13 != 0 [L135] lk13 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=0, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L138] COND TRUE p14 != 0 [L139] lk14 = 1 VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L144] COND FALSE !(p1 != 0) VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L149] COND FALSE !(p2 != 0) VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] [L217] __VERIFIER_error() VAL [cond=3, lk1=0, lk10=1, lk11=1, lk12=1, lk13=1, lk14=1, lk2=0, lk3=1, lk4=1, lk5=1, lk6=1, lk7=1, lk8=0, lk9=1, p1=0, p10=1, p11=1, p12=3, p13=1, p14=1, p2=0, p3=1, p4=1, p5=1, p6=1, p7=1, p8=0, p9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. Result: UNSAFE, OverallTime: 1.1s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 458 SDtfs, 227 SDslu, 301 SDs, 0 SdLazy, 20 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 5382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...