./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix011_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/pthread-wmm/mix011_power.oepc.i -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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b93144eb8edb9f3014da74df1374fdf039bbd00 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.0-5485861 [2020-10-26 00:15:03,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 00:15:03,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 00:15:03,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 00:15:03,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 00:15:03,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 00:15:03,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 00:15:03,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 00:15:03,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 00:15:03,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 00:15:03,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 00:15:03,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 00:15:03,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 00:15:03,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 00:15:03,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 00:15:03,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 00:15:03,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 00:15:03,735 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 00:15:03,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 00:15:03,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 00:15:03,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 00:15:03,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 00:15:03,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 00:15:03,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 00:15:03,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 00:15:03,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 00:15:03,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 00:15:03,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 00:15:03,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 00:15:03,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 00:15:03,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 00:15:03,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 00:15:03,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 00:15:03,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 00:15:03,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 00:15:03,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 00:15:03,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 00:15:03,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 00:15:03,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 00:15:03,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 00:15:03,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 00:15:03,769 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-26 00:15:03,797 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 00:15:03,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 00:15:03,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 00:15:03,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 00:15:03,800 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 00:15:03,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 00:15:03,800 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 00:15:03,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 00:15:03,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 00:15:03,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 00:15:03,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 00:15:03,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 00:15:03,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 00:15:03,802 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 00:15:03,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 00:15:03,802 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 00:15:03,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 00:15:03,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 00:15:03,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 00:15:03,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 00:15:03,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 00:15:03,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:15:03,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 00:15:03,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 00:15:03,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 00:15:03,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 00:15:03,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 00:15:03,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 00:15:03,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 00:15:03,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 2b93144eb8edb9f3014da74df1374fdf039bbd00 [2020-10-26 00:15:04,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 00:15:04,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 00:15:04,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 00:15:04,283 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 00:15:04,284 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 00:15:04,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix011_power.oepc.i [2020-10-26 00:15:04,372 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3494a3abc/7365a090102f4353b65cb201e69eeb89/FLAG3f9ba5792 [2020-10-26 00:15:05,189 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 00:15:05,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix011_power.oepc.i [2020-10-26 00:15:05,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3494a3abc/7365a090102f4353b65cb201e69eeb89/FLAG3f9ba5792 [2020-10-26 00:15:05,429 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3494a3abc/7365a090102f4353b65cb201e69eeb89 [2020-10-26 00:15:05,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 00:15:05,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 00:15:05,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 00:15:05,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 00:15:05,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 00:15:05,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:15:05" (1/1) ... [2020-10-26 00:15:05,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21cfdbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:05, skipping insertion in model container [2020-10-26 00:15:05,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:15:05" (1/1) ... [2020-10-26 00:15:05,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 00:15:05,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 00:15:06,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:15:06,106 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 00:15:06,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:15:06,284 INFO L208 MainTranslator]: Completed translation [2020-10-26 00:15:06,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06 WrapperNode [2020-10-26 00:15:06,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 00:15:06,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 00:15:06,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 00:15:06,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 00:15:06,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06" (1/1) ... [2020-10-26 00:15:06,317 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06" (1/1) ... [2020-10-26 00:15:06,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 00:15:06,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 00:15:06,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 00:15:06,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 00:15:06,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06" (1/1) ... [2020-10-26 00:15:06,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06" (1/1) ... [2020-10-26 00:15:06,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06" (1/1) ... [2020-10-26 00:15:06,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06" (1/1) ... [2020-10-26 00:15:06,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06" (1/1) ... [2020-10-26 00:15:06,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06" (1/1) ... [2020-10-26 00:15:06,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06" (1/1) ... [2020-10-26 00:15:06,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 00:15:06,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 00:15:06,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 00:15:06,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 00:15:06,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06" (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 [2020-10-26 00:15:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 00:15:06,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-26 00:15:06,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 00:15:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 00:15:06,520 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-26 00:15:06,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-26 00:15:06,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-26 00:15:06,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-26 00:15:06,522 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-26 00:15:06,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-26 00:15:06,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 00:15:06,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-26 00:15:06,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 00:15:06,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 00:15:06,526 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-26 00:15:09,119 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 00:15:09,119 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-26 00:15:09,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:15:09 BoogieIcfgContainer [2020-10-26 00:15:09,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 00:15:09,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 00:15:09,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 00:15:09,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 00:15:09,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 12:15:05" (1/3) ... [2020-10-26 00:15:09,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ed475d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:15:09, skipping insertion in model container [2020-10-26 00:15:09,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:15:06" (2/3) ... [2020-10-26 00:15:09,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ed475d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:15:09, skipping insertion in model container [2020-10-26 00:15:09,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:15:09" (3/3) ... [2020-10-26 00:15:09,132 INFO L111 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc.i [2020-10-26 00:15:09,144 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-26 00:15:09,145 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 00:15:09,151 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-26 00:15:09,152 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-26 00:15:09,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,190 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,190 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,191 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,195 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,195 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,198 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,198 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,204 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,206 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,206 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,206 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,212 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,214 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,221 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,222 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,222 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,224 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,225 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:15:09,228 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-26 00:15:09,242 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-26 00:15:09,268 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 00:15:09,268 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 00:15:09,268 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 00:15:09,268 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 00:15:09,268 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 00:15:09,269 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 00:15:09,269 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 00:15:09,269 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 00:15:09,283 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-26 00:15:09,286 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 108 transitions, 231 flow [2020-10-26 00:15:09,289 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 108 transitions, 231 flow [2020-10-26 00:15:09,292 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 115 places, 108 transitions, 231 flow [2020-10-26 00:15:09,346 INFO L129 PetriNetUnfolder]: 3/105 cut-off events. [2020-10-26 00:15:09,347 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-26 00:15:09,352 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 3/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2020-10-26 00:15:09,356 INFO L116 LiptonReduction]: Number of co-enabled transitions 2166 [2020-10-26 00:15:09,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:09,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:09,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:09,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:09,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:09,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:09,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:09,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:09,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:09,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:09,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:09,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:09,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:09,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:09,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:09,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:10,089 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-26 00:15:10,233 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-26 00:15:10,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:10,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:10,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:10,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:10,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:10,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:10,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:10,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:10,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:10,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:10,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:10,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:10,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:10,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:10,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:10,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:10,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:10,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:10,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:15:10,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:15:10,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:15:10,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:15:10,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:15:10,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:15:10,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:15:10,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:10,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:15:10,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:10,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:15:10,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:10,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:15:10,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:15:10,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:15:10,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:10,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:10,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:10,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:10,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:10,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:10,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:10,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:10,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:10,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:10,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:10,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:10,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:10,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:10,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:10,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:10,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:11,260 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-10-26 00:15:11,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:15:11,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:15:11,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:15:11,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:11,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:11,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:11,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:15:11,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:15:11,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:15:11,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:15:11,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:15:11,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:15:11,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:15:11,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:11,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:15:11,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:11,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:15:11,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:11,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:11,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:11,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:11,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:11,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:11,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:11,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:11,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:11,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:11,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:11,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:11,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:11,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:11,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:11,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:11,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:11,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:11,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:11,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:11,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:11,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:11,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:11,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:11,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:11,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:11,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:11,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:11,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:11,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:11,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:11,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:11,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:12,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:15:12,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:12,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:15:12,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:12,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:15:12,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:12,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:15:12,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:12,441 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-26 00:15:12,579 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-26 00:15:12,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:15:12,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:12,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:15:12,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:12,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:12,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:12,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:12,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:12,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:12,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:12,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:12,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:12,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:12,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:12,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:12,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:12,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:12,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:12,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:12,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:12,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:15:12,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:12,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:15:12,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:12,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:15:12,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:12,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:15:12,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:13,079 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-10-26 00:15:13,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:13,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:13,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:13,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:13,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:13,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:13,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:13,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:13,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:13,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:13,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:13,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:13,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:13,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:13,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:13,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:13,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:13,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:13,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:13,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:13,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:13,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:13,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:13,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:15:13,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:13,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:13,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:13,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:13,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:15:13,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:13,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:15:13,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:15:13,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:15:13,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:15:14,416 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-26 00:15:14,605 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2020-10-26 00:15:15,154 WARN L193 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-10-26 00:15:15,424 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-26 00:15:15,430 INFO L131 LiptonReduction]: Checked pairs total: 6300 [2020-10-26 00:15:15,430 INFO L133 LiptonReduction]: Total number of compositions: 95 [2020-10-26 00:15:15,437 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-10-26 00:15:15,550 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1382 states. [2020-10-26 00:15:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states. [2020-10-26 00:15:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-26 00:15:15,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:15:15,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-26 00:15:15,562 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:15:15,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:15:15,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1114054, now seen corresponding path program 1 times [2020-10-26 00:15:15,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:15:15,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684839116] [2020-10-26 00:15:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:15:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:15:15,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684839116] [2020-10-26 00:15:15,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:15:15,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:15:15,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891626161] [2020-10-26 00:15:15,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:15:15,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:15:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:15:15,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:15:15,827 INFO L87 Difference]: Start difference. First operand 1382 states. Second operand 3 states. [2020-10-26 00:15:15,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:15:15,937 INFO L93 Difference]: Finished difference Result 1152 states and 3742 transitions. [2020-10-26 00:15:15,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:15:15,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-26 00:15:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:15:15,984 INFO L225 Difference]: With dead ends: 1152 [2020-10-26 00:15:15,985 INFO L226 Difference]: Without dead ends: 972 [2020-10-26 00:15:15,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:15:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2020-10-26 00:15:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2020-10-26 00:15:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2020-10-26 00:15:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3118 transitions. [2020-10-26 00:15:16,164 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3118 transitions. Word has length 3 [2020-10-26 00:15:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:15:16,165 INFO L481 AbstractCegarLoop]: Abstraction has 972 states and 3118 transitions. [2020-10-26 00:15:16,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:15:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3118 transitions. [2020-10-26 00:15:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-26 00:15:16,168 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:15:16,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:15:16,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 00:15:16,169 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:15:16,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:15:16,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1390766049, now seen corresponding path program 1 times [2020-10-26 00:15:16,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:15:16,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574968930] [2020-10-26 00:15:16,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:15:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:15:16,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574968930] [2020-10-26 00:15:16,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:15:16,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:15:16,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075992045] [2020-10-26 00:15:16,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:15:16,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:15:16,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:15:16,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:15:16,321 INFO L87 Difference]: Start difference. First operand 972 states and 3118 transitions. Second operand 4 states. [2020-10-26 00:15:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:15:16,356 INFO L93 Difference]: Finished difference Result 1128 states and 3482 transitions. [2020-10-26 00:15:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:15:16,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-26 00:15:16,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:15:16,365 INFO L225 Difference]: With dead ends: 1128 [2020-10-26 00:15:16,365 INFO L226 Difference]: Without dead ends: 948 [2020-10-26 00:15:16,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:15:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2020-10-26 00:15:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2020-10-26 00:15:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2020-10-26 00:15:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 3026 transitions. [2020-10-26 00:15:16,403 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 3026 transitions. Word has length 10 [2020-10-26 00:15:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:15:16,405 INFO L481 AbstractCegarLoop]: Abstraction has 948 states and 3026 transitions. [2020-10-26 00:15:16,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:15:16,405 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 3026 transitions. [2020-10-26 00:15:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 00:15:16,408 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:15:16,408 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:15:16,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 00:15:16,408 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:15:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:15:16,409 INFO L82 PathProgramCache]: Analyzing trace with hash 594892316, now seen corresponding path program 1 times [2020-10-26 00:15:16,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:15:16,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518167459] [2020-10-26 00:15:16,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:15:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:15:16,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518167459] [2020-10-26 00:15:16,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:15:16,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:15:16,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350469704] [2020-10-26 00:15:16,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:15:16,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:15:16,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:15:16,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:15:16,525 INFO L87 Difference]: Start difference. First operand 948 states and 3026 transitions. Second operand 4 states. [2020-10-26 00:15:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:15:16,571 INFO L93 Difference]: Finished difference Result 1004 states and 3088 transitions. [2020-10-26 00:15:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:15:16,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-26 00:15:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:15:16,583 INFO L225 Difference]: With dead ends: 1004 [2020-10-26 00:15:16,583 INFO L226 Difference]: Without dead ends: 836 [2020-10-26 00:15:16,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:15:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2020-10-26 00:15:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2020-10-26 00:15:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2020-10-26 00:15:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 2622 transitions. [2020-10-26 00:15:16,660 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 2622 transitions. Word has length 11 [2020-10-26 00:15:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:15:16,661 INFO L481 AbstractCegarLoop]: Abstraction has 836 states and 2622 transitions. [2020-10-26 00:15:16,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:15:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 2622 transitions. [2020-10-26 00:15:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-26 00:15:16,668 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:15:16,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:15:16,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 00:15:16,669 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:15:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:15:16,670 INFO L82 PathProgramCache]: Analyzing trace with hash 458916291, now seen corresponding path program 1 times [2020-10-26 00:15:16,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:15:16,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171392656] [2020-10-26 00:15:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:15:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:15:16,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171392656] [2020-10-26 00:15:16,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:15:16,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:15:16,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931853082] [2020-10-26 00:15:16,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:15:16,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:15:16,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:15:16,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:15:16,780 INFO L87 Difference]: Start difference. First operand 836 states and 2622 transitions. Second operand 4 states. [2020-10-26 00:15:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:15:16,810 INFO L93 Difference]: Finished difference Result 884 states and 2694 transitions. [2020-10-26 00:15:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:15:16,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-26 00:15:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:15:16,818 INFO L225 Difference]: With dead ends: 884 [2020-10-26 00:15:16,818 INFO L226 Difference]: Without dead ends: 772 [2020-10-26 00:15:16,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:15:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2020-10-26 00:15:16,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2020-10-26 00:15:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-10-26 00:15:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2398 transitions. [2020-10-26 00:15:16,849 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2398 transitions. Word has length 13 [2020-10-26 00:15:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:15:16,850 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 2398 transitions. [2020-10-26 00:15:16,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:15:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2398 transitions. [2020-10-26 00:15:16,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-26 00:15:16,852 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:15:16,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:15:16,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 00:15:16,852 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:15:16,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:15:16,853 INFO L82 PathProgramCache]: Analyzing trace with hash 127920006, now seen corresponding path program 1 times [2020-10-26 00:15:16,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:15:16,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856015560] [2020-10-26 00:15:16,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:15:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:15:16,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856015560] [2020-10-26 00:15:16,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:15:16,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:15:16,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627191471] [2020-10-26 00:15:16,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:15:16,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:15:16,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:15:16,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:15:16,941 INFO L87 Difference]: Start difference. First operand 772 states and 2398 transitions. Second operand 4 states. [2020-10-26 00:15:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:15:16,979 INFO L93 Difference]: Finished difference Result 680 states and 1854 transitions. [2020-10-26 00:15:16,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:15:16,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-26 00:15:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:15:16,983 INFO L225 Difference]: With dead ends: 680 [2020-10-26 00:15:16,984 INFO L226 Difference]: Without dead ends: 500 [2020-10-26 00:15:16,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:15:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-10-26 00:15:16,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2020-10-26 00:15:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-10-26 00:15:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1310 transitions. [2020-10-26 00:15:17,001 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1310 transitions. Word has length 14 [2020-10-26 00:15:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:15:17,002 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 1310 transitions. [2020-10-26 00:15:17,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:15:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1310 transitions. [2020-10-26 00:15:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-26 00:15:17,003 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:15:17,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:15:17,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 00:15:17,004 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:15:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:15:17,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1768121393, now seen corresponding path program 1 times [2020-10-26 00:15:17,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:15:17,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904139384] [2020-10-26 00:15:17,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:15:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:15:17,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904139384] [2020-10-26 00:15:17,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:15:17,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:15:17,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669533119] [2020-10-26 00:15:17,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:15:17,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:15:17,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:15:17,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:15:17,141 INFO L87 Difference]: Start difference. First operand 500 states and 1310 transitions. Second operand 5 states. [2020-10-26 00:15:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:15:17,207 INFO L93 Difference]: Finished difference Result 384 states and 931 transitions. [2020-10-26 00:15:17,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:15:17,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-26 00:15:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:15:17,211 INFO L225 Difference]: With dead ends: 384 [2020-10-26 00:15:17,211 INFO L226 Difference]: Without dead ends: 304 [2020-10-26 00:15:17,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:15:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-10-26 00:15:17,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-10-26 00:15:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-10-26 00:15:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 722 transitions. [2020-10-26 00:15:17,222 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 722 transitions. Word has length 17 [2020-10-26 00:15:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:15:17,222 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 722 transitions. [2020-10-26 00:15:17,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:15:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 722 transitions. [2020-10-26 00:15:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-26 00:15:17,224 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:15:17,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:15:17,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 00:15:17,225 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:15:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:15:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash -349115701, now seen corresponding path program 1 times [2020-10-26 00:15:17,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:15:17,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218111579] [2020-10-26 00:15:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:15:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:15:17,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218111579] [2020-10-26 00:15:17,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:15:17,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:15:17,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406960137] [2020-10-26 00:15:17,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 00:15:17,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:15:17,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 00:15:17,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:15:17,463 INFO L87 Difference]: Start difference. First operand 304 states and 722 transitions. Second operand 6 states. [2020-10-26 00:15:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:15:17,550 INFO L93 Difference]: Finished difference Result 271 states and 654 transitions. [2020-10-26 00:15:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 00:15:17,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-26 00:15:17,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:15:17,553 INFO L225 Difference]: With dead ends: 271 [2020-10-26 00:15:17,553 INFO L226 Difference]: Without dead ends: 256 [2020-10-26 00:15:17,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:15:17,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-10-26 00:15:17,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2020-10-26 00:15:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-10-26 00:15:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 626 transitions. [2020-10-26 00:15:17,564 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 626 transitions. Word has length 20 [2020-10-26 00:15:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:15:17,565 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 626 transitions. [2020-10-26 00:15:17,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 00:15:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 626 transitions. [2020-10-26 00:15:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 00:15:17,566 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:15:17,567 INFO L422 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] [2020-10-26 00:15:17,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 00:15:17,567 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:15:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:15:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1811614932, now seen corresponding path program 1 times [2020-10-26 00:15:17,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:15:17,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863783681] [2020-10-26 00:15:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:15:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:15:17,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863783681] [2020-10-26 00:15:17,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:15:17,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:15:17,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128599939] [2020-10-26 00:15:17,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:15:17,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:15:17,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:15:17,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:15:17,667 INFO L87 Difference]: Start difference. First operand 256 states and 626 transitions. Second operand 4 states. [2020-10-26 00:15:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:15:17,691 INFO L93 Difference]: Finished difference Result 379 states and 910 transitions. [2020-10-26 00:15:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:15:17,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-26 00:15:17,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:15:17,693 INFO L225 Difference]: With dead ends: 379 [2020-10-26 00:15:17,694 INFO L226 Difference]: Without dead ends: 176 [2020-10-26 00:15:17,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:15:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-26 00:15:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-26 00:15:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-26 00:15:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 396 transitions. [2020-10-26 00:15:17,702 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 396 transitions. Word has length 24 [2020-10-26 00:15:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:15:17,703 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 396 transitions. [2020-10-26 00:15:17,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:15:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 396 transitions. [2020-10-26 00:15:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 00:15:17,704 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:15:17,704 INFO L422 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] [2020-10-26 00:15:17,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 00:15:17,705 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:15:17,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:15:17,706 INFO L82 PathProgramCache]: Analyzing trace with hash -893155314, now seen corresponding path program 2 times [2020-10-26 00:15:17,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:15:17,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798396929] [2020-10-26 00:15:17,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:15:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:15:17,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798396929] [2020-10-26 00:15:17,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:15:17,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-26 00:15:17,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877841714] [2020-10-26 00:15:17,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-26 00:15:17,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:15:17,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-26 00:15:17,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-26 00:15:17,876 INFO L87 Difference]: Start difference. First operand 176 states and 396 transitions. Second operand 10 states. [2020-10-26 00:15:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:15:18,033 INFO L93 Difference]: Finished difference Result 224 states and 495 transitions. [2020-10-26 00:15:18,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-26 00:15:18,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-26 00:15:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:15:18,037 INFO L225 Difference]: With dead ends: 224 [2020-10-26 00:15:18,037 INFO L226 Difference]: Without dead ends: 176 [2020-10-26 00:15:18,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:15:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-26 00:15:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-26 00:15:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-26 00:15:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 388 transitions. [2020-10-26 00:15:18,045 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 388 transitions. Word has length 24 [2020-10-26 00:15:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:15:18,047 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 388 transitions. [2020-10-26 00:15:18,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-26 00:15:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 388 transitions. [2020-10-26 00:15:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 00:15:18,048 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:15:18,048 INFO L422 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] [2020-10-26 00:15:18,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 00:15:18,049 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:15:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:15:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash 201499378, now seen corresponding path program 3 times [2020-10-26 00:15:18,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:15:18,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536612797] [2020-10-26 00:15:18,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:15:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:15:18,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536612797] [2020-10-26 00:15:18,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:15:18,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:15:18,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93343169] [2020-10-26 00:15:18,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:15:18,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:15:18,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:15:18,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:15:18,200 INFO L87 Difference]: Start difference. First operand 176 states and 388 transitions. Second operand 5 states. [2020-10-26 00:15:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:15:18,244 INFO L93 Difference]: Finished difference Result 200 states and 423 transitions. [2020-10-26 00:15:18,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:15:18,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-10-26 00:15:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:15:18,247 INFO L225 Difference]: With dead ends: 200 [2020-10-26 00:15:18,247 INFO L226 Difference]: Without dead ends: 121 [2020-10-26 00:15:18,247 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:15:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-10-26 00:15:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-10-26 00:15:18,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-26 00:15:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 256 transitions. [2020-10-26 00:15:18,252 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 256 transitions. Word has length 24 [2020-10-26 00:15:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:15:18,253 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 256 transitions. [2020-10-26 00:15:18,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:15:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 256 transitions. [2020-10-26 00:15:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 00:15:18,254 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:15:18,254 INFO L422 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] [2020-10-26 00:15:18,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 00:15:18,255 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:15:18,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:15:18,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1672866664, now seen corresponding path program 4 times [2020-10-26 00:15:18,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:15:18,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531585838] [2020-10-26 00:15:18,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:15:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:15:18,378 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:15:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:15:18,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:15:18,544 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 00:15:18,545 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 00:15:18,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 00:15:18,585 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,585 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,585 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,586 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [748] [2020-10-26 00:15:18,588 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,589 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,589 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,589 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,590 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,592 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,592 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,594 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,594 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,598 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,598 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,600 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,600 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,600 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,600 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,601 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,601 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,602 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,602 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,602 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,602 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,603 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,603 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,603 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 12:15:18 BasicIcfg [2020-10-26 00:15:18,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 00:15:18,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 00:15:18,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 00:15:18,694 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 00:15:18,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:15:09" (3/4) ... [2020-10-26 00:15:18,697 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-26 00:15:18,723 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,724 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [748] [2020-10-26 00:15:18,725 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,725 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,725 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,726 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,726 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,726 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,728 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,728 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,728 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,728 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,729 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,729 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,729 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,730 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,730 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,730 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,731 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,731 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,731 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,732 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,732 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,732 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,733 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,733 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,733 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,734 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,734 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,734 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:15:18,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:15:18,881 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 00:15:18,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 00:15:18,887 INFO L168 Benchmark]: Toolchain (without parser) took 13449.01 ms. Allocated memory was 44.0 MB in the beginning and 230.7 MB in the end (delta: 186.6 MB). Free memory was 20.1 MB in the beginning and 143.3 MB in the end (delta: -123.2 MB). Peak memory consumption was 64.4 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:18,888 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 44.0 MB. Free memory is still 31.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 00:15:18,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.99 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 19.4 MB in the beginning and 26.6 MB in the end (delta: -7.2 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:18,889 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.33 ms. Allocated memory is still 56.6 MB. Free memory was 26.6 MB in the beginning and 38.0 MB in the end (delta: -11.4 MB). Peak memory consumption was 2.7 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:18,889 INFO L168 Benchmark]: Boogie Preprocessor took 66.01 ms. Allocated memory is still 56.6 MB. Free memory was 38.0 MB in the beginning and 35.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:18,890 INFO L168 Benchmark]: RCFGBuilder took 2680.51 ms. Allocated memory was 56.6 MB in the beginning and 86.0 MB in the end (delta: 29.4 MB). Free memory was 35.7 MB in the beginning and 61.5 MB in the end (delta: -25.9 MB). Peak memory consumption was 39.5 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:18,890 INFO L168 Benchmark]: TraceAbstraction took 9569.50 ms. Allocated memory was 86.0 MB in the beginning and 230.7 MB in the end (delta: 144.7 MB). Free memory was 60.8 MB in the beginning and 165.4 MB in the end (delta: -104.5 MB). Peak memory consumption was 128.7 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:18,891 INFO L168 Benchmark]: Witness Printer took 187.42 ms. Allocated memory is still 230.7 MB. Free memory was 165.4 MB in the beginning and 143.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-10-26 00:15:18,893 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 44.0 MB. Free memory is still 31.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 835.99 ms. Allocated memory was 44.0 MB in the beginning and 56.6 MB in the end (delta: 12.6 MB). Free memory was 19.4 MB in the beginning and 26.6 MB in the end (delta: -7.2 MB). Peak memory consumption was 8.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 77.33 ms. Allocated memory is still 56.6 MB. Free memory was 26.6 MB in the beginning and 38.0 MB in the end (delta: -11.4 MB). Peak memory consumption was 2.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 66.01 ms. Allocated memory is still 56.6 MB. Free memory was 38.0 MB in the beginning and 35.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2680.51 ms. Allocated memory was 56.6 MB in the beginning and 86.0 MB in the end (delta: 29.4 MB). Free memory was 35.7 MB in the beginning and 61.5 MB in the end (delta: -25.9 MB). Peak memory consumption was 39.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9569.50 ms. Allocated memory was 86.0 MB in the beginning and 230.7 MB in the end (delta: 144.7 MB). Free memory was 60.8 MB in the beginning and 165.4 MB in the end (delta: -104.5 MB). Peak memory consumption was 128.7 MB. Max. memory is 16.1 GB. * Witness Printer took 187.42 ms. Allocated memory is still 230.7 MB. Free memory was 165.4 MB in the beginning and 143.3 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1461 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 53 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 184 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.1s, 115 PlacesBefore, 39 PlacesAfterwards, 108 TransitionsBefore, 30 TransitionsAfterwards, 2166 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 95 TotalNumberOfCompositions, 6300 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t281; [L849] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L18] COND TRUE 1 !expression [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "mix011_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L850] 0 pthread_t t282; [L851] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t283; [L853] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 [L784] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 a$flush_delayed = weak$$choice2 [L813] 3 a$mem_tmp = a [L814] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L814] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L815] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L815] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L816] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L816] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L817] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L817] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L818] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L818] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L818] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L819] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L819] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L820] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 __unbuffered_p2_EBX = a [L822] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L822] 3 a = a$flush_delayed ? a$mem_tmp : a [L823] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] EXPR 1 a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L826] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L826] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L827] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L827] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L828] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L829] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L830] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L859] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L859] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L860] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L860] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L861] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L862] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L863] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix011_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 333 SDtfs, 339 SDslu, 708 SDs, 0 SdLazy, 243 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1382occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 8843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...