./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.0.i -s /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9222a3f5c6e43e50a123f3e3b8dc0081d2f8b337 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:45:23,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:45:23,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:45:23,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:45:23,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:45:23,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:45:23,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:45:23,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:45:23,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:45:23,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:45:23,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:45:23,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:45:23,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:45:23,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:45:23,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:45:23,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:45:23,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:45:23,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:45:23,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:45:23,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:45:23,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:45:23,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:45:23,734 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:45:23,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:45:23,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:45:23,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:45:23,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:45:23,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:45:23,737 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:45:23,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:45:23,738 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:45:23,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:45:23,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:45:23,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:45:23,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:45:23,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:45:23,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:45:23,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:45:23,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:45:23,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:45:23,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:45:23,742 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:45:23,751 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:45:23,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:45:23,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:45:23,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:45:23,752 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:45:23,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:45:23,753 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:45:23,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:45:23,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:45:23,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:45:23,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:45:23,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:45:23,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:45:23,754 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:45:23,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:45:23,754 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:45:23,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:45:23,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:45:23,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:45:23,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:45:23,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:45:23,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:45:23,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:45:23,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:45:23,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:45:23,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:45:23,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:45:23,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:45:23,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:45:23,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9222a3f5c6e43e50a123f3e3b8dc0081d2f8b337 [2019-12-07 18:45:23,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:45:23,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:45:23,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:45:23,868 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:45:23,869 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:45:23,869 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.0.i [2019-12-07 18:45:23,915 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/data/10f7e876a/0bc4b1b3aef2470ba641333c50967d6f/FLAG84c7d1dbc [2019-12-07 18:45:24,282 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:45:24,282 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.0.i [2019-12-07 18:45:24,293 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/data/10f7e876a/0bc4b1b3aef2470ba641333c50967d6f/FLAG84c7d1dbc [2019-12-07 18:45:24,302 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/data/10f7e876a/0bc4b1b3aef2470ba641333c50967d6f [2019-12-07 18:45:24,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:45:24,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:45:24,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:45:24,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:45:24,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:45:24,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:45:24" (1/1) ... [2019-12-07 18:45:24,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24, skipping insertion in model container [2019-12-07 18:45:24,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:45:24" (1/1) ... [2019-12-07 18:45:24,315 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:45:24,346 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:45:24,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:45:24,643 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:45:24,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:45:24,741 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:45:24,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24 WrapperNode [2019-12-07 18:45:24,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:45:24,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:45:24,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:45:24,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:45:24,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24" (1/1) ... [2019-12-07 18:45:24,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24" (1/1) ... [2019-12-07 18:45:24,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:45:24,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:45:24,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:45:24,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:45:24,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24" (1/1) ... [2019-12-07 18:45:24,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24" (1/1) ... [2019-12-07 18:45:24,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24" (1/1) ... [2019-12-07 18:45:24,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24" (1/1) ... [2019-12-07 18:45:24,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24" (1/1) ... [2019-12-07 18:45:24,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24" (1/1) ... [2019-12-07 18:45:24,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24" (1/1) ... [2019-12-07 18:45:24,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:45:24,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:45:24,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:45:24,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:45:24,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:45:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:45:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:45:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:45:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:45:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:45:24,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:45:24,851 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:45:24,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:45:24,852 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:45:24,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:45:24,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:45:24,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:45:24,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:45:24,853 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:45:25,257 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:45:25,257 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:45:25,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:45:25 BoogieIcfgContainer [2019-12-07 18:45:25,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:45:25,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:45:25,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:45:25,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:45:25,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:45:24" (1/3) ... [2019-12-07 18:45:25,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8cde02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:45:25, skipping insertion in model container [2019-12-07 18:45:25,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:45:24" (2/3) ... [2019-12-07 18:45:25,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8cde02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:45:25, skipping insertion in model container [2019-12-07 18:45:25,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:45:25" (3/3) ... [2019-12-07 18:45:25,263 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_rmo.opt.0.i [2019-12-07 18:45:25,269 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:45:25,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:45:25,274 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:45:25,275 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:45:25,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,304 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,304 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,316 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,316 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:45:25,344 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:45:25,356 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:45:25,356 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:45:25,356 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:45:25,357 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:45:25,357 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:45:25,357 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:45:25,357 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:45:25,357 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:45:25,367 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-07 18:45:25,368 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 18:45:25,429 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 18:45:25,430 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:45:25,444 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 934 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 18:45:25,464 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 18:45:25,502 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 18:45:25,502 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:45:25,510 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 934 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 18:45:25,534 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 18:45:25,534 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:45:29,060 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 18:45:29,226 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123368 [2019-12-07 18:45:29,226 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-07 18:45:29,228 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-07 18:45:31,777 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-07 18:45:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-07 18:45:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:45:31,820 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:31,820 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:31,820 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:31,824 INFO L82 PathProgramCache]: Analyzing trace with hash -668359293, now seen corresponding path program 1 times [2019-12-07 18:45:31,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:31,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492210309] [2019-12-07 18:45:31,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:31,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492210309] [2019-12-07 18:45:31,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:31,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:45:31,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346817200] [2019-12-07 18:45:31,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:45:31,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:31,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:45:31,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:45:31,990 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-07 18:45:32,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:32,382 INFO L93 Difference]: Finished difference Result 41734 states and 171976 transitions. [2019-12-07 18:45:32,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:45:32,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 18:45:32,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:32,625 INFO L225 Difference]: With dead ends: 41734 [2019-12-07 18:45:32,626 INFO L226 Difference]: Without dead ends: 38878 [2019-12-07 18:45:32,626 INFO L630 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 [2019-12-07 18:45:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38878 states. [2019-12-07 18:45:33,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38878 to 38878. [2019-12-07 18:45:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38878 states. [2019-12-07 18:45:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38878 states to 38878 states and 160088 transitions. [2019-12-07 18:45:34,046 INFO L78 Accepts]: Start accepts. Automaton has 38878 states and 160088 transitions. Word has length 7 [2019-12-07 18:45:34,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:34,047 INFO L462 AbstractCegarLoop]: Abstraction has 38878 states and 160088 transitions. [2019-12-07 18:45:34,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:45:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 38878 states and 160088 transitions. [2019-12-07 18:45:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:45:34,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:34,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:34,053 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:34,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:34,053 INFO L82 PathProgramCache]: Analyzing trace with hash 298788116, now seen corresponding path program 1 times [2019-12-07 18:45:34,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:34,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040185039] [2019-12-07 18:45:34,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:34,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040185039] [2019-12-07 18:45:34,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:34,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:45:34,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188643337] [2019-12-07 18:45:34,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:34,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:34,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:34,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:34,127 INFO L87 Difference]: Start difference. First operand 38878 states and 160088 transitions. Second operand 4 states. [2019-12-07 18:45:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:34,675 INFO L93 Difference]: Finished difference Result 61934 states and 244684 transitions. [2019-12-07 18:45:34,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:45:34,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:45:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:34,912 INFO L225 Difference]: With dead ends: 61934 [2019-12-07 18:45:34,912 INFO L226 Difference]: Without dead ends: 61902 [2019-12-07 18:45:34,913 INFO L630 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 [2019-12-07 18:45:35,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61902 states. [2019-12-07 18:45:36,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61902 to 60256. [2019-12-07 18:45:36,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60256 states. [2019-12-07 18:45:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60256 states to 60256 states and 239489 transitions. [2019-12-07 18:45:36,780 INFO L78 Accepts]: Start accepts. Automaton has 60256 states and 239489 transitions. Word has length 13 [2019-12-07 18:45:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:36,780 INFO L462 AbstractCegarLoop]: Abstraction has 60256 states and 239489 transitions. [2019-12-07 18:45:36,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 60256 states and 239489 transitions. [2019-12-07 18:45:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:45:36,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:36,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:36,784 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:36,785 INFO L82 PathProgramCache]: Analyzing trace with hash -46103865, now seen corresponding path program 1 times [2019-12-07 18:45:36,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:36,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736502356] [2019-12-07 18:45:36,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:36,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736502356] [2019-12-07 18:45:36,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:36,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:45:36,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477205669] [2019-12-07 18:45:36,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:36,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:36,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:36,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:36,829 INFO L87 Difference]: Start difference. First operand 60256 states and 239489 transitions. Second operand 4 states. [2019-12-07 18:45:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:37,267 INFO L93 Difference]: Finished difference Result 76784 states and 300751 transitions. [2019-12-07 18:45:37,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:45:37,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:45:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:37,450 INFO L225 Difference]: With dead ends: 76784 [2019-12-07 18:45:37,450 INFO L226 Difference]: Without dead ends: 76756 [2019-12-07 18:45:37,451 INFO L630 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 [2019-12-07 18:45:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76756 states. [2019-12-07 18:45:40,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76756 to 68490. [2019-12-07 18:45:40,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68490 states. [2019-12-07 18:45:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68490 states to 68490 states and 270892 transitions. [2019-12-07 18:45:40,352 INFO L78 Accepts]: Start accepts. Automaton has 68490 states and 270892 transitions. Word has length 16 [2019-12-07 18:45:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:40,352 INFO L462 AbstractCegarLoop]: Abstraction has 68490 states and 270892 transitions. [2019-12-07 18:45:40,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:40,352 INFO L276 IsEmpty]: Start isEmpty. Operand 68490 states and 270892 transitions. [2019-12-07 18:45:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:45:40,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:40,358 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:40,359 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:40,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash 523730593, now seen corresponding path program 1 times [2019-12-07 18:45:40,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:40,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777299480] [2019-12-07 18:45:40,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:40,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777299480] [2019-12-07 18:45:40,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:40,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:45:40,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475231688] [2019-12-07 18:45:40,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:45:40,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:40,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:45:40,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:45:40,433 INFO L87 Difference]: Start difference. First operand 68490 states and 270892 transitions. Second operand 3 states. [2019-12-07 18:45:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:40,696 INFO L93 Difference]: Finished difference Result 68520 states and 270829 transitions. [2019-12-07 18:45:40,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:45:40,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:45:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:40,853 INFO L225 Difference]: With dead ends: 68520 [2019-12-07 18:45:40,853 INFO L226 Difference]: Without dead ends: 68520 [2019-12-07 18:45:40,854 INFO L630 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 [2019-12-07 18:45:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68520 states. [2019-12-07 18:45:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68520 to 68431. [2019-12-07 18:45:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68431 states. [2019-12-07 18:45:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68431 states to 68431 states and 270638 transitions. [2019-12-07 18:45:42,679 INFO L78 Accepts]: Start accepts. Automaton has 68431 states and 270638 transitions. Word has length 18 [2019-12-07 18:45:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:42,679 INFO L462 AbstractCegarLoop]: Abstraction has 68431 states and 270638 transitions. [2019-12-07 18:45:42,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:45:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 68431 states and 270638 transitions. [2019-12-07 18:45:42,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:45:42,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:42,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:42,685 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:42,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:42,685 INFO L82 PathProgramCache]: Analyzing trace with hash 353080702, now seen corresponding path program 1 times [2019-12-07 18:45:42,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:42,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927633515] [2019-12-07 18:45:42,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:42,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:42,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927633515] [2019-12-07 18:45:42,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:42,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:45:42,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821772030] [2019-12-07 18:45:42,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:42,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:42,740 INFO L87 Difference]: Start difference. First operand 68431 states and 270638 transitions. Second operand 4 states. [2019-12-07 18:45:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:43,008 INFO L93 Difference]: Finished difference Result 68408 states and 270453 transitions. [2019-12-07 18:45:43,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:45:43,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 18:45:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:43,165 INFO L225 Difference]: With dead ends: 68408 [2019-12-07 18:45:43,165 INFO L226 Difference]: Without dead ends: 68408 [2019-12-07 18:45:43,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68408 states. [2019-12-07 18:45:44,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68408 to 68320. [2019-12-07 18:45:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68320 states. [2019-12-07 18:45:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68320 states to 68320 states and 270263 transitions. [2019-12-07 18:45:44,950 INFO L78 Accepts]: Start accepts. Automaton has 68320 states and 270263 transitions. Word has length 19 [2019-12-07 18:45:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:44,950 INFO L462 AbstractCegarLoop]: Abstraction has 68320 states and 270263 transitions. [2019-12-07 18:45:44,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 68320 states and 270263 transitions. [2019-12-07 18:45:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:45:44,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:44,956 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:44,957 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:44,957 INFO L82 PathProgramCache]: Analyzing trace with hash 846033422, now seen corresponding path program 1 times [2019-12-07 18:45:44,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:44,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049275931] [2019-12-07 18:45:44,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:45,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049275931] [2019-12-07 18:45:45,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:45,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:45:45,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608020436] [2019-12-07 18:45:45,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:45,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:45,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:45,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:45,006 INFO L87 Difference]: Start difference. First operand 68320 states and 270263 transitions. Second operand 4 states. [2019-12-07 18:45:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:45,253 INFO L93 Difference]: Finished difference Result 64314 states and 253996 transitions. [2019-12-07 18:45:45,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:45:45,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 18:45:45,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:45,391 INFO L225 Difference]: With dead ends: 64314 [2019-12-07 18:45:45,391 INFO L226 Difference]: Without dead ends: 64314 [2019-12-07 18:45:45,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:46,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64314 states. [2019-12-07 18:45:46,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64314 to 64314. [2019-12-07 18:45:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64314 states. [2019-12-07 18:45:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64314 states to 64314 states and 253996 transitions. [2019-12-07 18:45:47,113 INFO L78 Accepts]: Start accepts. Automaton has 64314 states and 253996 transitions. Word has length 19 [2019-12-07 18:45:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:47,113 INFO L462 AbstractCegarLoop]: Abstraction has 64314 states and 253996 transitions. [2019-12-07 18:45:47,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 64314 states and 253996 transitions. [2019-12-07 18:45:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:45:47,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:47,126 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:47,126 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:47,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:47,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1555300184, now seen corresponding path program 1 times [2019-12-07 18:45:47,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:47,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537192883] [2019-12-07 18:45:47,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:47,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537192883] [2019-12-07 18:45:47,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:47,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:45:47,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086968765] [2019-12-07 18:45:47,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:45:47,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:47,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:45:47,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:45:47,162 INFO L87 Difference]: Start difference. First operand 64314 states and 253996 transitions. Second operand 5 states. [2019-12-07 18:45:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:47,777 INFO L93 Difference]: Finished difference Result 77168 states and 300395 transitions. [2019-12-07 18:45:47,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:45:47,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 18:45:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:47,939 INFO L225 Difference]: With dead ends: 77168 [2019-12-07 18:45:47,939 INFO L226 Difference]: Without dead ends: 77116 [2019-12-07 18:45:47,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:45:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77116 states. [2019-12-07 18:45:49,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77116 to 63874. [2019-12-07 18:45:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63874 states. [2019-12-07 18:45:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63874 states to 63874 states and 252412 transitions. [2019-12-07 18:45:49,760 INFO L78 Accepts]: Start accepts. Automaton has 63874 states and 252412 transitions. Word has length 22 [2019-12-07 18:45:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:49,760 INFO L462 AbstractCegarLoop]: Abstraction has 63874 states and 252412 transitions. [2019-12-07 18:45:49,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:45:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 63874 states and 252412 transitions. [2019-12-07 18:45:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:45:49,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:49,824 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:49,824 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:49,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:49,824 INFO L82 PathProgramCache]: Analyzing trace with hash -493132648, now seen corresponding path program 1 times [2019-12-07 18:45:49,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:49,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641893682] [2019-12-07 18:45:49,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:49,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641893682] [2019-12-07 18:45:49,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:49,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:45:49,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275829898] [2019-12-07 18:45:49,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:49,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:49,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:49,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:49,869 INFO L87 Difference]: Start difference. First operand 63874 states and 252412 transitions. Second operand 4 states. [2019-12-07 18:45:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:50,486 INFO L93 Difference]: Finished difference Result 116176 states and 459347 transitions. [2019-12-07 18:45:50,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:45:50,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 18:45:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:50,753 INFO L225 Difference]: With dead ends: 116176 [2019-12-07 18:45:50,753 INFO L226 Difference]: Without dead ends: 116176 [2019-12-07 18:45:50,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:51,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116176 states. [2019-12-07 18:45:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116176 to 91942. [2019-12-07 18:45:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91942 states. [2019-12-07 18:45:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91942 states to 91942 states and 367946 transitions. [2019-12-07 18:45:53,366 INFO L78 Accepts]: Start accepts. Automaton has 91942 states and 367946 transitions. Word has length 33 [2019-12-07 18:45:53,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:53,366 INFO L462 AbstractCegarLoop]: Abstraction has 91942 states and 367946 transitions. [2019-12-07 18:45:53,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 91942 states and 367946 transitions. [2019-12-07 18:45:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:45:53,459 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:53,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:53,460 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:53,460 INFO L82 PathProgramCache]: Analyzing trace with hash 734357034, now seen corresponding path program 2 times [2019-12-07 18:45:53,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:53,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632964159] [2019-12-07 18:45:53,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:53,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632964159] [2019-12-07 18:45:53,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:53,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:45:53,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217391566] [2019-12-07 18:45:53,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:45:53,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:53,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:45:53,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:45:53,495 INFO L87 Difference]: Start difference. First operand 91942 states and 367946 transitions. Second operand 3 states. [2019-12-07 18:45:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:53,664 INFO L93 Difference]: Finished difference Result 50736 states and 177622 transitions. [2019-12-07 18:45:53,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:45:53,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 18:45:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:53,751 INFO L225 Difference]: With dead ends: 50736 [2019-12-07 18:45:53,751 INFO L226 Difference]: Without dead ends: 50736 [2019-12-07 18:45:53,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:45:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50736 states. [2019-12-07 18:45:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50736 to 50736. [2019-12-07 18:45:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50736 states. [2019-12-07 18:45:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50736 states to 50736 states and 177622 transitions. [2019-12-07 18:45:55,026 INFO L78 Accepts]: Start accepts. Automaton has 50736 states and 177622 transitions. Word has length 33 [2019-12-07 18:45:55,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:55,027 INFO L462 AbstractCegarLoop]: Abstraction has 50736 states and 177622 transitions. [2019-12-07 18:45:55,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:45:55,027 INFO L276 IsEmpty]: Start isEmpty. Operand 50736 states and 177622 transitions. [2019-12-07 18:45:55,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:45:55,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:55,071 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:55,071 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:55,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1754326611, now seen corresponding path program 1 times [2019-12-07 18:45:55,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:55,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390888896] [2019-12-07 18:45:55,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:55,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390888896] [2019-12-07 18:45:55,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:55,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:45:55,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049944326] [2019-12-07 18:45:55,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:45:55,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:55,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:45:55,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:45:55,099 INFO L87 Difference]: Start difference. First operand 50736 states and 177622 transitions. Second operand 3 states. [2019-12-07 18:45:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:55,260 INFO L93 Difference]: Finished difference Result 50556 states and 174360 transitions. [2019-12-07 18:45:55,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:45:55,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 18:45:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:55,353 INFO L225 Difference]: With dead ends: 50556 [2019-12-07 18:45:55,353 INFO L226 Difference]: Without dead ends: 50556 [2019-12-07 18:45:55,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:45:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50556 states. [2019-12-07 18:45:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50556 to 50346. [2019-12-07 18:45:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50346 states. [2019-12-07 18:45:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50346 states to 50346 states and 173754 transitions. [2019-12-07 18:45:56,409 INFO L78 Accepts]: Start accepts. Automaton has 50346 states and 173754 transitions. Word has length 34 [2019-12-07 18:45:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:56,409 INFO L462 AbstractCegarLoop]: Abstraction has 50346 states and 173754 transitions. [2019-12-07 18:45:56,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:45:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 50346 states and 173754 transitions. [2019-12-07 18:45:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:45:56,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:56,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:56,447 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:56,448 INFO L82 PathProgramCache]: Analyzing trace with hash 880845463, now seen corresponding path program 1 times [2019-12-07 18:45:56,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:56,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136768253] [2019-12-07 18:45:56,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:56,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136768253] [2019-12-07 18:45:56,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:56,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:45:56,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718870044] [2019-12-07 18:45:56,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:56,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:56,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:56,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:56,476 INFO L87 Difference]: Start difference. First operand 50346 states and 173754 transitions. Second operand 4 states. [2019-12-07 18:45:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:56,507 INFO L93 Difference]: Finished difference Result 7726 states and 22440 transitions. [2019-12-07 18:45:56,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:45:56,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 18:45:56,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:56,515 INFO L225 Difference]: With dead ends: 7726 [2019-12-07 18:45:56,515 INFO L226 Difference]: Without dead ends: 7726 [2019-12-07 18:45:56,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7726 states. [2019-12-07 18:45:56,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7726 to 7718. [2019-12-07 18:45:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7718 states. [2019-12-07 18:45:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7718 states to 7718 states and 22418 transitions. [2019-12-07 18:45:56,600 INFO L78 Accepts]: Start accepts. Automaton has 7718 states and 22418 transitions. Word has length 35 [2019-12-07 18:45:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:56,600 INFO L462 AbstractCegarLoop]: Abstraction has 7718 states and 22418 transitions. [2019-12-07 18:45:56,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 7718 states and 22418 transitions. [2019-12-07 18:45:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:45:56,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:56,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:56,606 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:56,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:56,606 INFO L82 PathProgramCache]: Analyzing trace with hash 181285084, now seen corresponding path program 1 times [2019-12-07 18:45:56,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:56,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112635387] [2019-12-07 18:45:56,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:56,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112635387] [2019-12-07 18:45:56,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:56,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:45:56,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201993940] [2019-12-07 18:45:56,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:45:56,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:56,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:45:56,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:45:56,805 INFO L87 Difference]: Start difference. First operand 7718 states and 22418 transitions. Second operand 9 states. [2019-12-07 18:45:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:57,953 INFO L93 Difference]: Finished difference Result 15446 states and 40732 transitions. [2019-12-07 18:45:57,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:45:57,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2019-12-07 18:45:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:57,967 INFO L225 Difference]: With dead ends: 15446 [2019-12-07 18:45:57,967 INFO L226 Difference]: Without dead ends: 14784 [2019-12-07 18:45:57,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:45:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14784 states. [2019-12-07 18:45:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14784 to 10377. [2019-12-07 18:45:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10377 states. [2019-12-07 18:45:58,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 29276 transitions. [2019-12-07 18:45:58,112 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 29276 transitions. Word has length 46 [2019-12-07 18:45:58,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:58,113 INFO L462 AbstractCegarLoop]: Abstraction has 10377 states and 29276 transitions. [2019-12-07 18:45:58,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:45:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 29276 transitions. [2019-12-07 18:45:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:45:58,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:58,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:58,121 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:58,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1232836532, now seen corresponding path program 2 times [2019-12-07 18:45:58,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:58,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677369237] [2019-12-07 18:45:58,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:45:58,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677369237] [2019-12-07 18:45:58,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:58,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:45:58,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18786865] [2019-12-07 18:45:58,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:45:58,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:58,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:45:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:45:58,328 INFO L87 Difference]: Start difference. First operand 10377 states and 29276 transitions. Second operand 10 states. [2019-12-07 18:46:00,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:00,274 INFO L93 Difference]: Finished difference Result 16010 states and 42114 transitions. [2019-12-07 18:46:00,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:46:00,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-12-07 18:46:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:00,297 INFO L225 Difference]: With dead ends: 16010 [2019-12-07 18:46:00,297 INFO L226 Difference]: Without dead ends: 13625 [2019-12-07 18:46:00,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:46:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13625 states. [2019-12-07 18:46:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13625 to 11305. [2019-12-07 18:46:00,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11305 states. [2019-12-07 18:46:00,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11305 states to 11305 states and 31531 transitions. [2019-12-07 18:46:00,436 INFO L78 Accepts]: Start accepts. Automaton has 11305 states and 31531 transitions. Word has length 46 [2019-12-07 18:46:00,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:00,436 INFO L462 AbstractCegarLoop]: Abstraction has 11305 states and 31531 transitions. [2019-12-07 18:46:00,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:46:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 11305 states and 31531 transitions. [2019-12-07 18:46:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 18:46:00,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:00,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:00,444 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:00,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:00,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1950563102, now seen corresponding path program 3 times [2019-12-07 18:46:00,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:00,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822795757] [2019-12-07 18:46:00,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:00,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822795757] [2019-12-07 18:46:00,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:00,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:46:00,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041608753] [2019-12-07 18:46:00,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:46:00,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:00,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:46:00,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:46:00,508 INFO L87 Difference]: Start difference. First operand 11305 states and 31531 transitions. Second operand 6 states. [2019-12-07 18:46:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:00,633 INFO L93 Difference]: Finished difference Result 19462 states and 54695 transitions. [2019-12-07 18:46:00,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:46:00,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-07 18:46:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:00,649 INFO L225 Difference]: With dead ends: 19462 [2019-12-07 18:46:00,650 INFO L226 Difference]: Without dead ends: 15379 [2019-12-07 18:46:00,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:46:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15379 states. [2019-12-07 18:46:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15379 to 14258. [2019-12-07 18:46:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14258 states. [2019-12-07 18:46:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14258 states to 14258 states and 40848 transitions. [2019-12-07 18:46:00,839 INFO L78 Accepts]: Start accepts. Automaton has 14258 states and 40848 transitions. Word has length 46 [2019-12-07 18:46:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:00,839 INFO L462 AbstractCegarLoop]: Abstraction has 14258 states and 40848 transitions. [2019-12-07 18:46:00,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:46:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 14258 states and 40848 transitions. [2019-12-07 18:46:00,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:46:00,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:00,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:00,850 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:00,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:00,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1138071248, now seen corresponding path program 1 times [2019-12-07 18:46:00,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:00,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014299338] [2019-12-07 18:46:00,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:00,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014299338] [2019-12-07 18:46:00,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:00,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:46:00,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74218832] [2019-12-07 18:46:00,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:46:00,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:00,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:46:00,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:46:00,896 INFO L87 Difference]: Start difference. First operand 14258 states and 40848 transitions. Second operand 4 states. [2019-12-07 18:46:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:00,955 INFO L93 Difference]: Finished difference Result 23232 states and 63723 transitions. [2019-12-07 18:46:00,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:46:00,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-07 18:46:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:00,968 INFO L225 Difference]: With dead ends: 23232 [2019-12-07 18:46:00,969 INFO L226 Difference]: Without dead ends: 13625 [2019-12-07 18:46:00,969 INFO L630 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 [2019-12-07 18:46:00,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13625 states. [2019-12-07 18:46:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13625 to 13612. [2019-12-07 18:46:01,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13612 states. [2019-12-07 18:46:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13612 states to 13612 states and 34962 transitions. [2019-12-07 18:46:01,111 INFO L78 Accepts]: Start accepts. Automaton has 13612 states and 34962 transitions. Word has length 47 [2019-12-07 18:46:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:01,111 INFO L462 AbstractCegarLoop]: Abstraction has 13612 states and 34962 transitions. [2019-12-07 18:46:01,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:46:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 13612 states and 34962 transitions. [2019-12-07 18:46:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:46:01,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:01,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:01,123 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:01,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash 115757032, now seen corresponding path program 2 times [2019-12-07 18:46:01,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:01,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408364952] [2019-12-07 18:46:01,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:01,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408364952] [2019-12-07 18:46:01,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:01,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:46:01,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325791976] [2019-12-07 18:46:01,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:46:01,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:46:01,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:46:01,175 INFO L87 Difference]: Start difference. First operand 13612 states and 34962 transitions. Second operand 5 states. [2019-12-07 18:46:01,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:01,225 INFO L93 Difference]: Finished difference Result 14539 states and 37125 transitions. [2019-12-07 18:46:01,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:46:01,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 18:46:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:01,236 INFO L225 Difference]: With dead ends: 14539 [2019-12-07 18:46:01,236 INFO L226 Difference]: Without dead ends: 11822 [2019-12-07 18:46:01,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:46:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11822 states. [2019-12-07 18:46:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11822 to 9977. [2019-12-07 18:46:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9977 states. [2019-12-07 18:46:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9977 states to 9977 states and 25731 transitions. [2019-12-07 18:46:01,349 INFO L78 Accepts]: Start accepts. Automaton has 9977 states and 25731 transitions. Word has length 47 [2019-12-07 18:46:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:01,349 INFO L462 AbstractCegarLoop]: Abstraction has 9977 states and 25731 transitions. [2019-12-07 18:46:01,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:46:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 9977 states and 25731 transitions. [2019-12-07 18:46:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 18:46:01,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:01,356 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:01,356 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:01,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:01,356 INFO L82 PathProgramCache]: Analyzing trace with hash -160832526, now seen corresponding path program 3 times [2019-12-07 18:46:01,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:01,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497165420] [2019-12-07 18:46:01,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:01,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497165420] [2019-12-07 18:46:01,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:01,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:46:01,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991672571] [2019-12-07 18:46:01,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:46:01,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:01,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:46:01,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:46:01,393 INFO L87 Difference]: Start difference. First operand 9977 states and 25731 transitions. Second operand 5 states. [2019-12-07 18:46:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:01,431 INFO L93 Difference]: Finished difference Result 8394 states and 22069 transitions. [2019-12-07 18:46:01,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:46:01,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 18:46:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:01,432 INFO L225 Difference]: With dead ends: 8394 [2019-12-07 18:46:01,432 INFO L226 Difference]: Without dead ends: 497 [2019-12-07 18:46:01,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:46:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2019-12-07 18:46:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2019-12-07 18:46:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-12-07 18:46:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1125 transitions. [2019-12-07 18:46:01,438 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1125 transitions. Word has length 47 [2019-12-07 18:46:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:01,439 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 1125 transitions. [2019-12-07 18:46:01,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:46:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1125 transitions. [2019-12-07 18:46:01,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 18:46:01,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:01,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:01,440 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:01,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash 799739627, now seen corresponding path program 1 times [2019-12-07 18:46:01,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:01,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315570086] [2019-12-07 18:46:01,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:46:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:46:01,522 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:46:01,523 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:46:01,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_106| 0 0))) (and (= v_~y$flush_delayed~0_334 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t77~0.base_69| 1) |v_#valid_104|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd0~0_211 0) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff0_used~0_972 0) (= v_~y$w_buff1~0_277 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t77~0.base_69|) 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_59 0) (= 0 v_~y$r_buff0_thd2~0_408) (= v_~y$r_buff1_thd0~0_314 0) (= v_~y$w_buff1_used~0_548 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y$r_buff1_thd1~0_221 0) (= v_~__unbuffered_cnt~0_149 0) (= |v_ULTIMATE.start_main_~#t77~0.offset_41| 0) (= v_~y$r_buff0_thd1~0_150 0) (= v_~y$mem_tmp~0_266 0) (= 0 v_~__unbuffered_p0_EAX~0_59) (= v_~y~0_368 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd3~0_638) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_253) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t77~0.base_69| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t77~0.base_69|) |v_ULTIMATE.start_main_~#t77~0.offset_41| 0)) |v_#memory_int_19|) (= v_~z~0_27 0) (= 0 v_~y$w_buff0~0_388) (= 0 v_~__unbuffered_p2_EAX~0_67) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t77~0.base_69| 4)) (= 0 v_~y$r_buff1_thd3~0_405) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t77~0.base_69|) (= 0 v_~y$r_buff1_thd2~0_395) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~weak$$choice2~0_330 0) (= 0 v_~__unbuffered_p1_EAX~0_81) (= v_~__unbuffered_p2_EBX~0_61 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t77~0.base=|v_ULTIMATE.start_main_~#t77~0.base_69|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_266, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_405, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_334, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ULTIMATE.start_main_~#t78~0.offset=|v_ULTIMATE.start_main_~#t78~0.offset_41|, ULTIMATE.start_main_~#t77~0.offset=|v_ULTIMATE.start_main_~#t77~0.offset_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_54|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_117|, ~weak$$choice0~0=v_~weak$$choice0~0_253, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_408, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_47, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_972, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ULTIMATE.start_main_~#t79~0.offset=|v_ULTIMATE.start_main_~#t79~0.offset_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_221, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_638, ULTIMATE.start_main_~#t78~0.base=|v_ULTIMATE.start_main_~#t78~0.base_70|, ~y~0=v_~y~0_368, ULTIMATE.start_main_~#t79~0.base=|v_ULTIMATE.start_main_~#t79~0.base_43|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_74|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_478|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_211, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t77~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t78~0.offset, ULTIMATE.start_main_~#t77~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t79~0.offset, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t78~0.base, ~y~0, ULTIMATE.start_main_~#t79~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:46:01,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L835-1-->L837: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t78~0.base_12| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t78~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t78~0.base_12|) |v_ULTIMATE.start_main_~#t78~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t78~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t78~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t78~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t78~0.base_12|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t78~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t78~0.base=|v_ULTIMATE.start_main_~#t78~0.base_12|, #length=|v_#length_15|, ULTIMATE.start_main_~#t78~0.offset=|v_ULTIMATE.start_main_~#t78~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t78~0.base, #length, ULTIMATE.start_main_~#t78~0.offset] because there is no mapped edge [2019-12-07 18:46:01,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t79~0.base_11|) (= |v_ULTIMATE.start_main_~#t79~0.offset_9| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t79~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t79~0.base_11| 0)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t79~0.base_11| 1) |v_#valid_32|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t79~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t79~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t79~0.base_11|) |v_ULTIMATE.start_main_~#t79~0.offset_9| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t79~0.base=|v_ULTIMATE.start_main_~#t79~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t79~0.offset=|v_ULTIMATE.start_main_~#t79~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t79~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t79~0.offset, #length] because there is no mapped edge [2019-12-07 18:46:01,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_65 v_~y$w_buff0_used~0_118) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= 1 v_~y$w_buff0~0_43) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_65 256) 0)) (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_16| v_P2Thread1of1ForFork0_~arg.offset_14) (= v_~y$w_buff0_used~0_117 1) (= v_~y$w_buff0~0_44 v_~y$w_buff1~0_29) (= |v_P2Thread1of1ForFork0_#in~arg.base_16| v_P2Thread1of1ForFork0_~arg.base_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_14, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_43, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_14, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:46:01,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1640076758 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1640076758 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out1640076758| ~y$w_buff1~0_In1640076758) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1640076758| ~y$w_buff0~0_In1640076758) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1640076758, ~y$w_buff1~0=~y$w_buff1~0_In1640076758, ~y$w_buff0~0=~y$w_buff0~0_In1640076758, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1640076758} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1640076758|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1640076758, ~y$w_buff1~0=~y$w_buff1~0_In1640076758, ~y$w_buff0~0=~y$w_buff0~0_In1640076758, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1640076758} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:46:01,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L797-4-->L798: Formula: (= v_~y~0_64 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 18:46:01,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L802-->L803: Formula: (and (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff0_thd3~0_172) (not (= 0 (mod v_~weak$$choice2~0_74 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_74} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 18:46:01,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In373670562 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out373670562| ~y$mem_tmp~0_In373670562)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out373670562| ~y~0_In373670562) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In373670562, ~y$flush_delayed~0=~y$flush_delayed~0_In373670562, ~y~0=~y~0_In373670562} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out373670562|, ~y$mem_tmp~0=~y$mem_tmp~0_In373670562, ~y$flush_delayed~0=~y$flush_delayed~0_In373670562, ~y~0=~y~0_In373670562} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 18:46:01,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_22) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:46:01,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1673207555 256)))) (or (and .cse0 (= ~y~0_In1673207555 |P1Thread1of1ForFork2_#t~ite25_Out1673207555|)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1673207555| ~y$mem_tmp~0_In1673207555) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1673207555, ~y$flush_delayed~0=~y$flush_delayed~0_In1673207555, ~y~0=~y~0_In1673207555} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1673207555, ~y$flush_delayed~0=~y$flush_delayed~0_In1673207555, ~y~0=~y~0_In1673207555, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1673207555|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:46:01,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_266 |v_P1Thread1of1ForFork2_#t~ite25_114|) (= v_~__unbuffered_cnt~0_136 (+ v_~__unbuffered_cnt~0_137 1)) (= v_~y$flush_delayed~0_286 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_114|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136, ~y~0=v_~y~0_266, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_113|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:46:01,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1159952517 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1159952517 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out-1159952517| ~y$w_buff0_used~0_In-1159952517) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-1159952517| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1159952517, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1159952517} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1159952517, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1159952517, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1159952517|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 18:46:01,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In1611969394 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1611969394 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1611969394 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1611969394 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out1611969394|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite52_Out1611969394| ~y$w_buff1_used~0_In1611969394) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1611969394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1611969394, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1611969394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1611969394} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1611969394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1611969394, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1611969394, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1611969394|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1611969394} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 18:46:01,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In170320087 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In170320087 256))) (.cse2 (= ~y$r_buff0_thd3~0_In170320087 ~y$r_buff0_thd3~0_Out170320087))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out170320087 0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In170320087, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In170320087} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In170320087, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out170320087, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out170320087|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 18:46:01,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In2078305353 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In2078305353 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In2078305353 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2078305353 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In2078305353 |P2Thread1of1ForFork0_#t~ite54_Out2078305353|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out2078305353|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2078305353, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2078305353, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078305353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2078305353} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2078305353, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2078305353, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out2078305353|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078305353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2078305353} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:46:01,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd3~0_178 |v_P2Thread1of1ForFork0_#t~ite54_30|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_178, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:46:01,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L839-1-->L845: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_58) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:46:01,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L845-2-->L845-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In161726683 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In161726683 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out161726683| |ULTIMATE.start_main_#t~ite58_Out161726683|))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out161726683| ~y~0_In161726683) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In161726683 |ULTIMATE.start_main_#t~ite58_Out161726683|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In161726683, ~y~0=~y~0_In161726683, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In161726683, ~y$w_buff1_used~0=~y$w_buff1_used~0_In161726683} OutVars{~y$w_buff1~0=~y$w_buff1~0_In161726683, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out161726683|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out161726683|, ~y~0=~y~0_In161726683, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In161726683, ~y$w_buff1_used~0=~y$w_buff1_used~0_In161726683} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:46:01,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-808764839 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-808764839 256)))) (or (and (= ~y$w_buff0_used~0_In-808764839 |ULTIMATE.start_main_#t~ite60_Out-808764839|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out-808764839| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-808764839, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-808764839} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-808764839|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-808764839, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-808764839} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 18:46:01,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1599372720 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1599372720 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1599372720 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1599372720 256)))) (or (and (= ~y$w_buff1_used~0_In1599372720 |ULTIMATE.start_main_#t~ite61_Out1599372720|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out1599372720|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1599372720, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1599372720, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1599372720, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1599372720} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1599372720|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1599372720, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1599372720, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1599372720, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1599372720} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:46:01,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1846051980 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1846051980 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out1846051980| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out1846051980| ~y$r_buff0_thd0~0_In1846051980) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1846051980, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1846051980} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1846051980|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1846051980, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1846051980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:46:01,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1698877425 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1698877425 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1698877425 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1698877425 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1698877425| ~y$r_buff1_thd0~0_In-1698877425) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite63_Out-1698877425| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1698877425, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1698877425, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1698877425, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698877425} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1698877425|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1698877425, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1698877425, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1698877425, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698877425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:46:01,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_245 |v_ULTIMATE.start_main_#t~ite63_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:46:01,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:46:01 BasicIcfg [2019-12-07 18:46:01,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:46:01,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:46:01,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:46:01,601 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:46:01,601 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:45:25" (3/4) ... [2019-12-07 18:46:01,603 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:46:01,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_106| 0 0))) (and (= v_~y$flush_delayed~0_334 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t77~0.base_69| 1) |v_#valid_104|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd0~0_211 0) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff0_used~0_972 0) (= v_~y$w_buff1~0_277 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t77~0.base_69|) 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_59 0) (= 0 v_~y$r_buff0_thd2~0_408) (= v_~y$r_buff1_thd0~0_314 0) (= v_~y$w_buff1_used~0_548 0) (< 0 |v_#StackHeapBarrier_16|) (= v_~y$r_buff1_thd1~0_221 0) (= v_~__unbuffered_cnt~0_149 0) (= |v_ULTIMATE.start_main_~#t77~0.offset_41| 0) (= v_~y$r_buff0_thd1~0_150 0) (= v_~y$mem_tmp~0_266 0) (= 0 v_~__unbuffered_p0_EAX~0_59) (= v_~y~0_368 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd3~0_638) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= 0 v_~weak$$choice0~0_253) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t77~0.base_69| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t77~0.base_69|) |v_ULTIMATE.start_main_~#t77~0.offset_41| 0)) |v_#memory_int_19|) (= v_~z~0_27 0) (= 0 v_~y$w_buff0~0_388) (= 0 v_~__unbuffered_p2_EAX~0_67) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t77~0.base_69| 4)) (= 0 v_~y$r_buff1_thd3~0_405) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t77~0.base_69|) (= 0 v_~y$r_buff1_thd2~0_395) (= v_~__unbuffered_p1_EBX~0_68 0) (= v_~weak$$choice2~0_330 0) (= 0 v_~__unbuffered_p1_EAX~0_81) (= v_~__unbuffered_p2_EBX~0_61 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t77~0.base=|v_ULTIMATE.start_main_~#t77~0.base_69|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_266, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_405, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_81, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_334, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_67, ULTIMATE.start_main_~#t78~0.offset=|v_ULTIMATE.start_main_~#t78~0.offset_41|, ULTIMATE.start_main_~#t77~0.offset=|v_ULTIMATE.start_main_~#t77~0.offset_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_54|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_117|, ~weak$$choice0~0=v_~weak$$choice0~0_253, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_40|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_408, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_47, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_972, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ULTIMATE.start_main_~#t79~0.offset=|v_ULTIMATE.start_main_~#t79~0.offset_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_221, ~y$w_buff0~0=v_~y$w_buff0~0_388, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_638, ULTIMATE.start_main_~#t78~0.base=|v_ULTIMATE.start_main_~#t78~0.base_70|, ~y~0=v_~y~0_368, ULTIMATE.start_main_~#t79~0.base=|v_ULTIMATE.start_main_~#t79~0.base_43|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_68, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_74|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_478|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_43|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_211, #valid=|v_#valid_104|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_330, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t77~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t78~0.offset, ULTIMATE.start_main_~#t77~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t79~0.offset, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t78~0.base, ~y~0, ULTIMATE.start_main_~#t79~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:46:01,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L835-1-->L837: Formula: (and (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t78~0.base_12| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t78~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t78~0.base_12|) |v_ULTIMATE.start_main_~#t78~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t78~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t78~0.base_12| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t78~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t78~0.base_12|)) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t78~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t78~0.base=|v_ULTIMATE.start_main_~#t78~0.base_12|, #length=|v_#length_15|, ULTIMATE.start_main_~#t78~0.offset=|v_ULTIMATE.start_main_~#t78~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t78~0.base, #length, ULTIMATE.start_main_~#t78~0.offset] because there is no mapped edge [2019-12-07 18:46:01,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t79~0.base_11|) (= |v_ULTIMATE.start_main_~#t79~0.offset_9| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t79~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t79~0.base_11| 0)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t79~0.base_11| 1) |v_#valid_32|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t79~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t79~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t79~0.base_11|) |v_ULTIMATE.start_main_~#t79~0.offset_9| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t79~0.base=|v_ULTIMATE.start_main_~#t79~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t79~0.offset=|v_ULTIMATE.start_main_~#t79~0.offset_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t79~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t79~0.offset, #length] because there is no mapped edge [2019-12-07 18:46:01,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_65 v_~y$w_buff0_used~0_118) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= 1 v_~y$w_buff0~0_43) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_65 256) 0)) (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_16| v_P2Thread1of1ForFork0_~arg.offset_14) (= v_~y$w_buff0_used~0_117 1) (= v_~y$w_buff0~0_44 v_~y$w_buff1~0_29) (= |v_P2Thread1of1ForFork0_#in~arg.base_16| v_P2Thread1of1ForFork0_~arg.base_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff0~0=v_~y$w_buff0~0_44, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_14, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_16|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_14|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_43, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_14, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_16|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_16, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:46:01,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1640076758 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1640076758 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out1640076758| ~y$w_buff1~0_In1640076758) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out1640076758| ~y$w_buff0~0_In1640076758) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1640076758, ~y$w_buff1~0=~y$w_buff1~0_In1640076758, ~y$w_buff0~0=~y$w_buff0~0_In1640076758, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1640076758} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1640076758|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1640076758, ~y$w_buff1~0=~y$w_buff1~0_In1640076758, ~y$w_buff0~0=~y$w_buff0~0_In1640076758, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1640076758} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:46:01,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [912] [912] L797-4-->L798: Formula: (= v_~y~0_64 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 18:46:01,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L802-->L803: Formula: (and (= v_~y$r_buff0_thd3~0_173 v_~y$r_buff0_thd3~0_172) (not (= 0 (mod v_~weak$$choice2~0_74 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_173, ~weak$$choice2~0=v_~weak$$choice2~0_74} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_172, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_74} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 18:46:01,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In373670562 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out373670562| ~y$mem_tmp~0_In373670562)) (and (= |P2Thread1of1ForFork0_#t~ite48_Out373670562| ~y~0_In373670562) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In373670562, ~y$flush_delayed~0=~y$flush_delayed~0_In373670562, ~y~0=~y~0_In373670562} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out373670562|, ~y$mem_tmp~0=~y$mem_tmp~0_In373670562, ~y$flush_delayed~0=~y$flush_delayed~0_In373670562, ~y~0=~y~0_In373670562} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 18:46:01,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= v_~z~0_15 1) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_38 v_~__unbuffered_p0_EAX~0_22) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_38, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:46:01,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1673207555 256)))) (or (and .cse0 (= ~y~0_In1673207555 |P1Thread1of1ForFork2_#t~ite25_Out1673207555|)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1673207555| ~y$mem_tmp~0_In1673207555) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1673207555, ~y$flush_delayed~0=~y$flush_delayed~0_In1673207555, ~y~0=~y~0_In1673207555} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1673207555, ~y$flush_delayed~0=~y$flush_delayed~0_In1673207555, ~y~0=~y~0_In1673207555, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1673207555|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:46:01,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_266 |v_P1Thread1of1ForFork2_#t~ite25_114|) (= v_~__unbuffered_cnt~0_136 (+ v_~__unbuffered_cnt~0_137 1)) (= v_~y$flush_delayed~0_286 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_114|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_286, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136, ~y~0=v_~y~0_266, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_113|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:46:01,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1159952517 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1159952517 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out-1159952517| ~y$w_buff0_used~0_In-1159952517) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-1159952517| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1159952517, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1159952517} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1159952517, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1159952517, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1159952517|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 18:46:01,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In1611969394 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1611969394 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1611969394 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1611969394 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out1611969394|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite52_Out1611969394| ~y$w_buff1_used~0_In1611969394) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1611969394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1611969394, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1611969394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1611969394} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1611969394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1611969394, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1611969394, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1611969394|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1611969394} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 18:46:01,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In170320087 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In170320087 256))) (.cse2 (= ~y$r_buff0_thd3~0_In170320087 ~y$r_buff0_thd3~0_Out170320087))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out170320087 0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In170320087, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In170320087} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In170320087, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out170320087, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out170320087|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 18:46:01,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In2078305353 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In2078305353 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In2078305353 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In2078305353 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In2078305353 |P2Thread1of1ForFork0_#t~ite54_Out2078305353|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite54_Out2078305353|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2078305353, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2078305353, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078305353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2078305353} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2078305353, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2078305353, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out2078305353|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078305353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2078305353} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:46:01,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd3~0_178 |v_P2Thread1of1ForFork0_#t~ite54_30|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_178, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:46:01,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L839-1-->L845: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_58) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:46:01,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L845-2-->L845-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In161726683 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In161726683 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out161726683| |ULTIMATE.start_main_#t~ite58_Out161726683|))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out161726683| ~y~0_In161726683) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In161726683 |ULTIMATE.start_main_#t~ite58_Out161726683|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In161726683, ~y~0=~y~0_In161726683, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In161726683, ~y$w_buff1_used~0=~y$w_buff1_used~0_In161726683} OutVars{~y$w_buff1~0=~y$w_buff1~0_In161726683, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out161726683|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out161726683|, ~y~0=~y~0_In161726683, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In161726683, ~y$w_buff1_used~0=~y$w_buff1_used~0_In161726683} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:46:01,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-808764839 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-808764839 256)))) (or (and (= ~y$w_buff0_used~0_In-808764839 |ULTIMATE.start_main_#t~ite60_Out-808764839|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out-808764839| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-808764839, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-808764839} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-808764839|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-808764839, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-808764839} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 18:46:01,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1599372720 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1599372720 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1599372720 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1599372720 256)))) (or (and (= ~y$w_buff1_used~0_In1599372720 |ULTIMATE.start_main_#t~ite61_Out1599372720|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out1599372720|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1599372720, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1599372720, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1599372720, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1599372720} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1599372720|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1599372720, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1599372720, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1599372720, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1599372720} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:46:01,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1846051980 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1846051980 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out1846051980| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite62_Out1846051980| ~y$r_buff0_thd0~0_In1846051980) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1846051980, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1846051980} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1846051980|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1846051980, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1846051980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:46:01,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1698877425 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1698877425 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1698877425 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1698877425 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1698877425| ~y$r_buff1_thd0~0_In-1698877425) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite63_Out-1698877425| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1698877425, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1698877425, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1698877425, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698877425} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1698877425|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1698877425, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1698877425, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1698877425, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1698877425} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:46:01,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_245 |v_ULTIMATE.start_main_#t~ite63_46|) (= v_~main$tmp_guard1~0_20 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:46:01,681 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_968746e9-06ab-4811-818e-b414763826bd/bin/uautomizer/witness.graphml [2019-12-07 18:46:01,681 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:46:01,683 INFO L168 Benchmark]: Toolchain (without parser) took 37378.04 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 940.7 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 18:46:01,683 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:46:01,683 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -127.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:01,683 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:46:01,684 INFO L168 Benchmark]: Boogie Preprocessor took 26.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:01,684 INFO L168 Benchmark]: RCFGBuilder took 448.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:01,684 INFO L168 Benchmark]: TraceAbstraction took 36341.96 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:46:01,684 INFO L168 Benchmark]: Witness Printer took 80.74 ms. Allocated memory is still 4.6 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:01,686 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 436.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.5 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -127.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.44 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 448.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.4 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36341.96 ms. Allocated memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: 3.4 GB). Free memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 80.74 ms. Allocated memory is still 4.6 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 196 ProgramPointsBefore, 105 ProgramPointsAfterwards, 242 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9301 VarBasedMoverChecksPositive, 327 VarBasedMoverChecksNegative, 92 SemBasedMoverChecksPositive, 328 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 123368 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t77, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t78, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t79, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L790] 3 y$r_buff0_thd3 = (_Bool)1 [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 y$flush_delayed = weak$$choice2 [L796] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L800] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L801] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y = y$flush_delayed ? y$mem_tmp : y [L806] 3 y$flush_delayed = (_Bool)0 [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 2 x = 1 [L753] 2 __unbuffered_p1_EAX = x [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 36.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3761 SDtfs, 4303 SDslu, 6580 SDs, 0 SdLazy, 3125 SolverSat, 174 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91942occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 57489 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 591 NumberOfCodeBlocks, 591 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 511 ConstructedInterpolants, 0 QuantifiedInterpolants, 145625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...