java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/mutex_lock_struct_true-termination.c_true-unreach-call_1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:49:31,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:49:31,515 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:49:31,532 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:49:31,532 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:49:31,533 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:49:31,535 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:49:31,537 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:49:31,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:49:31,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:49:31,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:49:31,541 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:49:31,542 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:49:31,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:49:31,544 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:49:31,545 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:49:31,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:49:31,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:49:31,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:49:31,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:49:31,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:49:31,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:49:31,556 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:49:31,556 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:49:31,557 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:49:31,558 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:49:31,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:49:31,563 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:49:31,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:49:31,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:49:31,567 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:49:31,568 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:49:31,568 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:49:31,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:49:31,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:49:31,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:49:31,570 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 21:49:31,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:49:31,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:49:31,598 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:49:31,598 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:49:31,601 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:49:31,601 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:49:31,602 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:49:31,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:49:31,603 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:49:31,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:49:31,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:49:31,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:49:31,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:49:31,604 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:49:31,604 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:49:31,604 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:49:31,604 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:49:31,604 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:49:31,605 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:49:31,606 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:49:31,606 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:49:31,606 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:49:31,607 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:49:31,607 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:49:31,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:49:31,607 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:49:31,608 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:49:31,608 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:49:31,608 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:49:31,608 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:49:31,608 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:49:31,609 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:49:31,609 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:49:31,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:49:31,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:49:31,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:49:31,706 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:49:31,707 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:49:31,708 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/mutex_lock_struct_true-termination.c_true-unreach-call_1.i [2018-11-18 21:49:31,769 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e114ae27c/eb890e0b597c478cad80107d6555a725/FLAGa70f09a0c [2018-11-18 21:49:32,241 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:49:32,241 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/mutex_lock_struct_true-termination.c_true-unreach-call_1.i [2018-11-18 21:49:32,248 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e114ae27c/eb890e0b597c478cad80107d6555a725/FLAGa70f09a0c [2018-11-18 21:49:32,588 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e114ae27c/eb890e0b597c478cad80107d6555a725 [2018-11-18 21:49:32,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:49:32,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:49:32,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:49:32,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:49:32,610 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:49:32,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:49:32" (1/1) ... [2018-11-18 21:49:32,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9de181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:32, skipping insertion in model container [2018-11-18 21:49:32,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:49:32" (1/1) ... [2018-11-18 21:49:32,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:49:32,652 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:49:32,905 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:49:32,925 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:49:32,948 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:49:32,976 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:49:32,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:32 WrapperNode [2018-11-18 21:49:32,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:49:32,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:49:32,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:49:32,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:49:32,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:32" (1/1) ... [2018-11-18 21:49:32,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:32" (1/1) ... [2018-11-18 21:49:33,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:32" (1/1) ... [2018-11-18 21:49:33,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:32" (1/1) ... [2018-11-18 21:49:33,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:32" (1/1) ... [2018-11-18 21:49:33,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:32" (1/1) ... [2018-11-18 21:49:33,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:32" (1/1) ... [2018-11-18 21:49:33,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:49:33,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:49:33,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:49:33,039 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:49:33,040 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:32" (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 [2018-11-18 21:49:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:49:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:49:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure err [2018-11-18 21:49:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2018-11-18 21:49:33,163 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2018-11-18 21:49:33,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:49:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:49:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure err [2018-11-18 21:49:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2018-11-18 21:49:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:49:33,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:49:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2018-11-18 21:49:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:49:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:49:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:49:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:49:33,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:49:33,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:49:33,635 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:49:33,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:49:33 BoogieIcfgContainer [2018-11-18 21:49:33,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:49:33,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:49:33,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:49:33,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:49:33,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:49:32" (1/3) ... [2018-11-18 21:49:33,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fad63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:49:33, skipping insertion in model container [2018-11-18 21:49:33,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:49:32" (2/3) ... [2018-11-18 21:49:33,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fad63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:49:33, skipping insertion in model container [2018-11-18 21:49:33,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:49:33" (3/3) ... [2018-11-18 21:49:33,645 INFO L112 eAbstractionObserver]: Analyzing ICFG mutex_lock_struct_true-termination.c_true-unreach-call_1.i [2018-11-18 21:49:33,655 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:49:33,663 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 21:49:33,682 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 21:49:33,719 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:49:33,720 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:49:33,720 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:49:33,720 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:49:33,720 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:49:33,721 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:49:33,721 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:49:33,721 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:49:33,721 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:49:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-18 21:49:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 21:49:33,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:49:33,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:49:33,751 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:49:33,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:49:33,758 INFO L82 PathProgramCache]: Analyzing trace with hash 589228543, now seen corresponding path program 1 times [2018-11-18 21:49:33,763 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:49:33,764 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:49:33,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:49:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:49:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:49:33,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:49:34,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 21:49:34,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 21:49:34,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:49:34,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:49:34,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:49:34,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 21:49:34,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 21:49:34,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-18 21:49:34,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:49:34,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:49:34,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:49:34,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-18 21:49:34,521 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:49:34,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-18 21:49:34,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {32#true} is VALID [2018-11-18 21:49:34,583 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-18 21:49:34,583 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #38#return; {32#true} is VALID [2018-11-18 21:49:34,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2018-11-18 21:49:34,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4bv32);call write~intINTTYPE4(0bv32, ~#m~0.base, ~#m~0.offset, 4bv32); {52#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) (= (_ bv0 32) |main_~#m~0.offset|))} is VALID [2018-11-18 21:49:34,608 INFO L256 TraceCheckUtils]: 6: Hoare triple {52#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) (= (_ bv0 32) |main_~#m~0.offset|))} call mutex_lock(~#m~0.base, ~#m~0.offset); {56#(and (= (_ bv0 32) (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)) (= |mutex_lock_#in~a.offset| (_ bv0 32)))} is VALID [2018-11-18 21:49:34,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {56#(and (= (_ bv0 32) (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|)) (= |mutex_lock_#in~a.offset| (_ bv0 32)))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); {60#(= (_ bv0 32) |mutex_lock_#t~mem0|)} is VALID [2018-11-18 21:49:34,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {60#(= (_ bv0 32) |mutex_lock_#t~mem0|)} assume 1bv32 == #t~mem0;havoc #t~mem0; {33#false} is VALID [2018-11-18 21:49:34,611 INFO L256 TraceCheckUtils]: 9: Hoare triple {33#false} call err(); {33#false} is VALID [2018-11-18 21:49:34,611 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-18 21:49:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:49:34,614 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:49:34,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:49:34,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 21:49:34,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-18 21:49:34,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:49:34,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 21:49:34,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:49:34,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 21:49:34,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 21:49:34,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 21:49:34,694 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2018-11-18 21:49:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:49:35,501 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-11-18 21:49:35,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 21:49:35,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-18 21:49:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:49:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:49:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-18 21:49:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 21:49:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2018-11-18 21:49:35,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2018-11-18 21:49:35,938 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:49:35,949 INFO L225 Difference]: With dead ends: 46 [2018-11-18 21:49:35,949 INFO L226 Difference]: Without dead ends: 18 [2018-11-18 21:49:35,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 21:49:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-18 21:49:36,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 21:49:36,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:49:36,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-18 21:49:36,003 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-18 21:49:36,003 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-18 21:49:36,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:49:36,006 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-18 21:49:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-18 21:49:36,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:49:36,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:49:36,008 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-18 21:49:36,008 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-18 21:49:36,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:49:36,011 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-18 21:49:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-18 21:49:36,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:49:36,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:49:36,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:49:36,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:49:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 21:49:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2018-11-18 21:49:36,017 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 11 [2018-11-18 21:49:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:49:36,017 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2018-11-18 21:49:36,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 21:49:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-11-18 21:49:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 21:49:36,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:49:36,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:49:36,019 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:49:36,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:49:36,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1259031447, now seen corresponding path program 1 times [2018-11-18 21:49:36,020 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:49:36,020 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:49:36,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:49:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:49:36,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:49:36,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:49:36,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 21:49:36,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 21:49:36,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:49:36,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:49:36,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:49:36,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-18 21:49:36,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 21:49:36,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-18 21:49:36,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:49:36,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:49:36,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:49:36,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-18 21:49:36,558 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:49:36,579 INFO L256 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2018-11-18 21:49:36,579 INFO L273 TraceCheckUtils]: 1: Hoare triple {196#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {196#true} is VALID [2018-11-18 21:49:36,580 INFO L273 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2018-11-18 21:49:36,580 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #38#return; {196#true} is VALID [2018-11-18 21:49:36,580 INFO L256 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret2 := main(); {196#true} is VALID [2018-11-18 21:49:36,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {196#true} call ~#m~0.base, ~#m~0.offset := #Ultimate.alloc(4bv32);call write~intINTTYPE4(0bv32, ~#m~0.base, ~#m~0.offset, 4bv32); {216#(= (_ bv0 32) |main_~#m~0.offset|)} is VALID [2018-11-18 21:49:36,586 INFO L256 TraceCheckUtils]: 6: Hoare triple {216#(= (_ bv0 32) |main_~#m~0.offset|)} call mutex_lock(~#m~0.base, ~#m~0.offset); {196#true} is VALID [2018-11-18 21:49:36,587 INFO L273 TraceCheckUtils]: 7: Hoare triple {196#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem0 := read~intINTTYPE4(~a.base, ~a.offset, 4bv32); {223#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2018-11-18 21:49:36,587 INFO L273 TraceCheckUtils]: 8: Hoare triple {223#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} assume !(1bv32 == #t~mem0);havoc #t~mem0; {223#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} is VALID [2018-11-18 21:49:36,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#(and (= |mutex_lock_#in~a.base| mutex_lock_~a.base) (= |mutex_lock_#in~a.offset| mutex_lock_~a.offset))} call write~intINTTYPE4(1bv32, ~a.base, ~a.offset, 4bv32); {230#(= (_ bv1 32) (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))} is VALID [2018-11-18 21:49:36,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {230#(= (_ bv1 32) (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))} assume true; {230#(= (_ bv1 32) (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))} is VALID [2018-11-18 21:49:36,591 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {230#(= (_ bv1 32) (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))} {216#(= (_ bv0 32) |main_~#m~0.offset|)} #42#return; {237#(and (= (_ bv1 32) (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) (= (_ bv0 32) |main_~#m~0.offset|))} is VALID [2018-11-18 21:49:36,593 INFO L256 TraceCheckUtils]: 12: Hoare triple {237#(and (= (_ bv1 32) (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) (= (_ bv0 32) |main_~#m~0.offset|))} call mutex_unlock(~#m~0.base, ~#m~0.offset); {241#(and (= (_ bv1 32) (select (select |#memory_int| |mutex_unlock_#in~b.base|) (_ bv0 32))) (= (_ bv0 32) |mutex_unlock_#in~b.offset|))} is VALID [2018-11-18 21:49:36,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {241#(and (= (_ bv1 32) (select (select |#memory_int| |mutex_unlock_#in~b.base|) (_ bv0 32))) (= (_ bv0 32) |mutex_unlock_#in~b.offset|))} ~b.base, ~b.offset := #in~b.base, #in~b.offset;call #t~mem1 := read~intINTTYPE4(~b.base, ~b.offset, 4bv32); {245#(= (bvadd |mutex_unlock_#t~mem1| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:49:36,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {245#(= (bvadd |mutex_unlock_#t~mem1| (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != #t~mem1;havoc #t~mem1; {197#false} is VALID [2018-11-18 21:49:36,598 INFO L256 TraceCheckUtils]: 15: Hoare triple {197#false} call err(); {197#false} is VALID [2018-11-18 21:49:36,598 INFO L273 TraceCheckUtils]: 16: Hoare triple {197#false} assume !false; {197#false} is VALID [2018-11-18 21:49:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:49:36,600 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:49:36,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:49:36,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 21:49:36,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-18 21:49:36,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:49:36,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 21:49:36,650 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:49:36,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 21:49:36,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 21:49:36,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-18 21:49:36,651 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand 8 states. [2018-11-18 21:49:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:49:36,989 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-11-18 21:49:36,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 21:49:36,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-18 21:49:36,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:49:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 21:49:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-18 21:49:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 21:49:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-18 21:49:36,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 17 transitions. [2018-11-18 21:49:37,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:49:37,022 INFO L225 Difference]: With dead ends: 18 [2018-11-18 21:49:37,022 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 21:49:37,024 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-18 21:49:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 21:49:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 21:49:37,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:49:37,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 21:49:37,024 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 21:49:37,025 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 21:49:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:49:37,025 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 21:49:37,025 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:49:37,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:49:37,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:49:37,026 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 21:49:37,026 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 21:49:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:49:37,027 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 21:49:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:49:37,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:49:37,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:49:37,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:49:37,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:49:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 21:49:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 21:49:37,028 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-18 21:49:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:49:37,028 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 21:49:37,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 21:49:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 21:49:37,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:49:37,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 21:49:37,334 INFO L421 ceAbstractionStarter]: At program point mutex_unlockENTRY(lines 25 29) the Hoare annotation is: (or (= (_ bv1 32) (select (select |#memory_int| |mutex_unlock_#in~b.base|) (_ bv0 32))) (not (= (bvadd (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) |mutex_unlock_#in~b.offset|))) [2018-11-18 21:49:37,335 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-18 21:49:37,335 INFO L425 ceAbstractionStarter]: For program point mutex_unlockEXIT(lines 25 29) no Hoare annotation was computed. [2018-11-18 21:49:37,335 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (or (not (= (bvadd (select (select |old(#memory_int)| |mutex_unlock_#in~b.base|) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) |mutex_unlock_#in~b.offset|))) [2018-11-18 21:49:37,335 INFO L425 ceAbstractionStarter]: For program point L27-3(line 27) no Hoare annotation was computed. [2018-11-18 21:49:37,335 INFO L425 ceAbstractionStarter]: For program point mutex_unlockFINAL(lines 25 29) no Hoare annotation was computed. [2018-11-18 21:49:37,335 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 21:49:37,335 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 21:49:37,335 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 21:49:37,336 INFO L425 ceAbstractionStarter]: For program point errErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2018-11-18 21:49:37,336 INFO L425 ceAbstractionStarter]: For program point errEXIT(lines 12 13) no Hoare annotation was computed. [2018-11-18 21:49:37,336 INFO L428 ceAbstractionStarter]: At program point errENTRY(lines 12 13) the Hoare annotation is: true [2018-11-18 21:49:37,336 INFO L425 ceAbstractionStarter]: For program point errFINAL(lines 12 13) no Hoare annotation was computed. [2018-11-18 21:49:37,336 INFO L421 ceAbstractionStarter]: At program point mutex_lockENTRY(lines 19 23) the Hoare annotation is: (or (not (= (_ bv0 32) (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))) (not (= |mutex_lock_#in~a.offset| (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_int| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))) [2018-11-18 21:49:37,336 INFO L425 ceAbstractionStarter]: For program point mutex_lockFINAL(lines 19 23) no Hoare annotation was computed. [2018-11-18 21:49:37,336 INFO L425 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-18 21:49:37,336 INFO L425 ceAbstractionStarter]: For program point mutex_lockEXIT(lines 19 23) no Hoare annotation was computed. [2018-11-18 21:49:37,337 INFO L421 ceAbstractionStarter]: At program point L21-1(line 21) the Hoare annotation is: (or (not (= (_ bv0 32) (select (select |old(#memory_int)| |mutex_lock_#in~a.base|) |mutex_lock_#in~a.offset|))) (not (= |mutex_lock_#in~a.offset| (_ bv0 32)))) [2018-11-18 21:49:37,337 INFO L425 ceAbstractionStarter]: For program point L21-3(line 21) no Hoare annotation was computed. [2018-11-18 21:49:37,337 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 21:49:37,337 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 21:49:37,337 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 21:49:37,337 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 21:49:37,337 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 31 43) the Hoare annotation is: true [2018-11-18 21:49:37,338 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 31 43) no Hoare annotation was computed. [2018-11-18 21:49:37,338 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 31 43) no Hoare annotation was computed. [2018-11-18 21:49:37,338 INFO L425 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2018-11-18 21:49:37,338 INFO L421 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (and (= (_ bv0 32) (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) (= (_ bv0 32) |main_~#m~0.offset|)) [2018-11-18 21:49:37,338 INFO L421 ceAbstractionStarter]: At program point L36-1(line 36) the Hoare annotation is: (and (= (_ bv1 32) (select (select |#memory_int| |main_~#m~0.base|) |main_~#m~0.offset|)) (= (_ bv0 32) |main_~#m~0.offset|)) [2018-11-18 21:49:37,340 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-18 21:49:37,340 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 21:49:37,340 WARN L170 areAnnotationChecker]: errErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2018-11-18 21:49:37,341 WARN L170 areAnnotationChecker]: errFINAL has no Hoare annotation [2018-11-18 21:49:37,341 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-18 21:49:37,355 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-18 21:49:37,355 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2018-11-18 21:49:37,356 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-18 21:49:37,356 WARN L170 areAnnotationChecker]: errFINAL has no Hoare annotation [2018-11-18 21:49:37,356 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-18 21:49:37,356 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-18 21:49:37,356 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 21:49:37,370 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2018-11-18 21:49:37,370 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2018-11-18 21:49:37,370 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 21:49:37,371 WARN L170 areAnnotationChecker]: errEXIT has no Hoare annotation [2018-11-18 21:49:37,371 WARN L170 areAnnotationChecker]: errEXIT has no Hoare annotation [2018-11-18 21:49:37,371 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-18 21:49:37,371 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2018-11-18 21:49:37,371 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 21:49:37,371 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-18 21:49:37,380 WARN L170 areAnnotationChecker]: mutex_unlockFINAL has no Hoare annotation [2018-11-18 21:49:37,380 WARN L170 areAnnotationChecker]: mutex_lockFINAL has no Hoare annotation [2018-11-18 21:49:37,380 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-18 21:49:37,380 WARN L170 areAnnotationChecker]: mutex_unlockEXIT has no Hoare annotation [2018-11-18 21:49:37,381 WARN L170 areAnnotationChecker]: mutex_lockEXIT has no Hoare annotation [2018-11-18 21:49:37,381 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 21:49:37,381 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 21:49:37,381 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 21:49:37,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:49:37 BoogieIcfgContainer [2018-11-18 21:49:37,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 21:49:37,387 INFO L168 Benchmark]: Toolchain (without parser) took 4787.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -572.5 MB). Peak memory consumption was 165.7 MB. Max. memory is 7.1 GB. [2018-11-18 21:49:37,388 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:49:37,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 21:49:37,390 INFO L168 Benchmark]: Boogie Preprocessor took 59.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 21:49:37,390 INFO L168 Benchmark]: RCFGBuilder took 598.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-18 21:49:37,391 INFO L168 Benchmark]: TraceAbstraction took 3748.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 190.1 MB). Peak memory consumption was 190.1 MB. Max. memory is 7.1 GB. [2018-11-18 21:49:37,395 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 375.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 598.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3748.39 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 190.1 MB). Peak memory consumption was 190.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. SAFE Result, 3.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 4 SDslu, 98 SDs, 0 SdLazy, 38 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 15 PreInvPairs, 16 NumberOfFragments, 93 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 1376 SizeOfPredicates, 14 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...