./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df684da5e5a56662a7be6091ec5bb0a21e1453c5 .................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:27:00,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:27:00,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:27:00,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:27:00,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:27:00,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:27:00,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:27:00,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:27:00,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:27:00,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:27:01,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:27:01,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:27:01,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:27:01,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:27:01,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:27:01,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:27:01,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:27:01,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:27:01,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:27:01,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:27:01,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:27:01,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:27:01,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:27:01,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:27:01,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:27:01,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:27:01,024 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:27:01,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:27:01,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:27:01,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:27:01,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:27:01,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:27:01,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:27:01,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:27:01,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:27:01,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:27:01,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:27:01,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:27:01,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:27:01,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:27:01,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:27:01,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:27:01,050 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:27:01,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:27:01,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:27:01,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:27:01,052 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:27:01,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:27:01,052 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:27:01,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:27:01,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:27:01,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:27:01,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:27:01,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:27:01,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:27:01,054 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:27:01,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:27:01,054 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:27:01,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:27:01,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:27:01,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:27:01,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:27:01,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:27:01,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:27:01,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:27:01,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:27:01,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:27:01,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:27:01,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:27:01,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:27:01,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df684da5e5a56662a7be6091ec5bb0a21e1453c5 [2019-11-28 00:27:01,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:27:01,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:27:01,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:27:01,370 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:27:01,371 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:27:01,372 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2019-11-28 00:27:01,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7d4f25a/3ae506155a3b4435afe1f65669fd8638/FLAGb258c7468 [2019-11-28 00:27:02,000 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:27:02,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-2.c [2019-11-28 00:27:02,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7d4f25a/3ae506155a3b4435afe1f65669fd8638/FLAGb258c7468 [2019-11-28 00:27:02,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7d4f25a/3ae506155a3b4435afe1f65669fd8638 [2019-11-28 00:27:02,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:27:02,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:27:02,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:27:02,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:27:02,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:27:02,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:02" (1/1) ... [2019-11-28 00:27:02,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c4f24d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02, skipping insertion in model container [2019-11-28 00:27:02,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:02" (1/1) ... [2019-11-28 00:27:02,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:27:02,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:27:02,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:27:02,672 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:27:02,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:27:02,816 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:27:02,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02 WrapperNode [2019-11-28 00:27:02,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:27:02,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:27:02,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:27:02,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:27:02,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02" (1/1) ... [2019-11-28 00:27:02,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02" (1/1) ... [2019-11-28 00:27:02,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:27:02,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:27:02,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:27:02,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:27:02,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02" (1/1) ... [2019-11-28 00:27:02,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02" (1/1) ... [2019-11-28 00:27:02,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02" (1/1) ... [2019-11-28 00:27:02,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02" (1/1) ... [2019-11-28 00:27:02,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02" (1/1) ... [2019-11-28 00:27:02,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02" (1/1) ... [2019-11-28 00:27:02,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02" (1/1) ... [2019-11-28 00:27:02,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:27:02,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:27:02,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:27:02,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:27:02,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:27:02,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:27:02,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:27:03,512 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:27:03,513 INFO L297 CfgBuilder]: Removed 60 assume(true) statements. [2019-11-28 00:27:03,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:03 BoogieIcfgContainer [2019-11-28 00:27:03,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:27:03,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:27:03,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:27:03,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:27:03,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:27:02" (1/3) ... [2019-11-28 00:27:03,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d8f582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:03, skipping insertion in model container [2019-11-28 00:27:03,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:02" (2/3) ... [2019-11-28 00:27:03,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d8f582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:03, skipping insertion in model container [2019-11-28 00:27:03,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:03" (3/3) ... [2019-11-28 00:27:03,525 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2.c [2019-11-28 00:27:03,535 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:27:03,543 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:27:03,556 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:27:03,582 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:27:03,582 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:27:03,583 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:27:03,583 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:27:03,583 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:27:03,583 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:27:03,583 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:27:03,584 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:27:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states. [2019-11-28 00:27:03,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:27:03,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:03,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:03,609 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:03,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1129554405, now seen corresponding path program 1 times [2019-11-28 00:27:03,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:03,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503008757] [2019-11-28 00:27:03,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:03,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503008757] [2019-11-28 00:27:03,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:03,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:03,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270663013] [2019-11-28 00:27:03,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:03,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:03,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:03,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:03,844 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 3 states. [2019-11-28 00:27:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:04,025 INFO L93 Difference]: Finished difference Result 272 states and 425 transitions. [2019-11-28 00:27:04,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:04,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 00:27:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:04,047 INFO L225 Difference]: With dead ends: 272 [2019-11-28 00:27:04,047 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 00:27:04,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 00:27:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 172. [2019-11-28 00:27:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-28 00:27:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2019-11-28 00:27:04,120 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 33 [2019-11-28 00:27:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:04,120 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2019-11-28 00:27:04,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2019-11-28 00:27:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:27:04,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:04,122 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:04,123 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash 875581448, now seen corresponding path program 1 times [2019-11-28 00:27:04,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:04,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803141510] [2019-11-28 00:27:04,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:04,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803141510] [2019-11-28 00:27:04,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:04,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:04,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889849443] [2019-11-28 00:27:04,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:04,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:04,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:04,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:04,192 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand 3 states. [2019-11-28 00:27:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:04,304 INFO L93 Difference]: Finished difference Result 495 states and 723 transitions. [2019-11-28 00:27:04,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:04,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 00:27:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:04,310 INFO L225 Difference]: With dead ends: 495 [2019-11-28 00:27:04,312 INFO L226 Difference]: Without dead ends: 339 [2019-11-28 00:27:04,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-11-28 00:27:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 333. [2019-11-28 00:27:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-28 00:27:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 482 transitions. [2019-11-28 00:27:04,382 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 482 transitions. Word has length 33 [2019-11-28 00:27:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:04,382 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 482 transitions. [2019-11-28 00:27:04,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:04,383 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 482 transitions. [2019-11-28 00:27:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:27:04,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:04,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:04,387 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:04,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:04,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1133746886, now seen corresponding path program 1 times [2019-11-28 00:27:04,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:04,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513727636] [2019-11-28 00:27:04,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:04,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513727636] [2019-11-28 00:27:04,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:04,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:27:04,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577061982] [2019-11-28 00:27:04,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:27:04,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:04,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:27:04,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:27:04,520 INFO L87 Difference]: Start difference. First operand 333 states and 482 transitions. Second operand 5 states. [2019-11-28 00:27:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:04,676 INFO L93 Difference]: Finished difference Result 1067 states and 1549 transitions. [2019-11-28 00:27:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:27:04,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 00:27:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:04,681 INFO L225 Difference]: With dead ends: 1067 [2019-11-28 00:27:04,682 INFO L226 Difference]: Without dead ends: 789 [2019-11-28 00:27:04,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:27:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-11-28 00:27:04,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 345. [2019-11-28 00:27:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-11-28 00:27:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 490 transitions. [2019-11-28 00:27:04,720 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 490 transitions. Word has length 33 [2019-11-28 00:27:04,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:04,721 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 490 transitions. [2019-11-28 00:27:04,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:27:04,721 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 490 transitions. [2019-11-28 00:27:04,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:27:04,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:04,723 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:04,724 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:04,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:04,724 INFO L82 PathProgramCache]: Analyzing trace with hash 316098436, now seen corresponding path program 1 times [2019-11-28 00:27:04,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:04,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984219559] [2019-11-28 00:27:04,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:27:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:27:04,826 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:27:04,826 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:27:04,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:27:04 BoogieIcfgContainer [2019-11-28 00:27:04,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:27:04,903 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:27:04,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:27:04,905 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:27:04,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:03" (3/4) ... [2019-11-28 00:27:04,908 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:27:05,017 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:27:05,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:27:05,020 INFO L168 Benchmark]: Toolchain (without parser) took 2647.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 955.0 MB in the beginning and 999.7 MB in the end (delta: -44.7 MB). Peak memory consumption was 96.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:05,021 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:27:05,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:05,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:27:05,023 INFO L168 Benchmark]: Boogie Preprocessor took 35.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:05,023 INFO L168 Benchmark]: RCFGBuilder took 611.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:05,024 INFO L168 Benchmark]: TraceAbstraction took 1385.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.8 MB). Peak memory consumption was 85.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:05,025 INFO L168 Benchmark]: Witness Printer took 114.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 999.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:05,028 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 444.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -176.1 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 611.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1385.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.8 MB). Peak memory consumption was 85.8 MB. Max. memory is 11.5 GB. * Witness Printer took 114.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 999.7 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int q_buf_0 ; [L16] int q_free ; [L17] int q_read_ev ; [L18] int q_write_ev ; [L19] int q_req_up ; [L20] int q_ev ; [L41] int p_num_write ; [L42] int p_last_write ; [L43] int p_dw_st ; [L44] int p_dw_pc ; [L45] int p_dw_i ; [L46] int c_num_read ; [L47] int c_last_read ; [L48] int c_dr_st ; [L49] int c_dr_pc ; [L50] int c_dr_i ; [L154] static int a_t ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0] [L456] int __retres1 ; [L442] q_free = 1 [L443] q_write_ev = 2 [L444] q_read_ev = q_write_ev [L445] p_num_write = 0 [L446] p_dw_pc = 0 [L447] p_dw_i = 1 [L448] c_num_read = 0 [L449] c_dr_pc = 0 [L450] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L396] int kernel_st ; [L397] int tmp ; [L401] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L212] COND FALSE !((int )q_req_up == 1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L227] COND TRUE (int )p_dw_i == 1 [L228] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L232] COND TRUE (int )c_dr_i == 1 [L233] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L265] COND FALSE !((int )q_read_ev == 0) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L270] COND FALSE !((int )q_write_ev == 0) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L298] int tmp ; [L299] int tmp___0 ; [L52] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L55] COND FALSE !((int )p_dw_pc == 1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L65] __retres1 = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L67] return (__retres1); VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L303] tmp = is_do_write_p_triggered() [L305] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L71] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L74] COND FALSE !((int )c_dr_pc == 1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L84] __retres1 = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L86] return (__retres1); VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L311] tmp___0 = is_do_read_c_triggered() [L313] COND FALSE !(\read(tmp___0)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L283] COND FALSE !((int )q_read_ev == 1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L288] COND FALSE !((int )q_write_ev == 1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L409] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L412] kernel_st = 1 [L323] int tmp ; [L324] int tmp___0 ; [L325] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L329] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L242] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L245] COND TRUE (int )p_dw_st == 0 [L246] __retres1 = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L258] return (__retres1); VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L332] tmp___1 = exists_runnable_thread() [L334] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L339] COND TRUE (int )p_dw_st == 0 [L341] tmp = __VERIFIER_nondet_int() [L343] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] [L10] __VERIFIER_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 96 locations, 3 error locations. Result: UNSAFE, OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 414 SDtfs, 625 SDslu, 807 SDs, 0 SdLazy, 64 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=345occurred 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, 3 MinimizatonAttempts, 456 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 5248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...