./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix001_pso.opt.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_947f9dd3-414b-442b-9f11-203f344b36a0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix001_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/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 0b14062a43b2ee92a3ad64a2a77645ba6654a627 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:53:29,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:53:29,017 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:53:29,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:53:29,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:53:29,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:53:29,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:53:29,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:53:29,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:53:29,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:53:29,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:53:29,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:53:29,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:53:29,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:53:29,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:53:29,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:53:29,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:53:29,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:53:29,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:53:29,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:53:29,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:53:29,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:53:29,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:53:29,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:53:29,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:53:29,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:53:29,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:53:29,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:53:29,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:53:29,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:53:29,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:53:29,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:53:29,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:53:29,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:53:29,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:53:29,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:53:29,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:53:29,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:53:29,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:53:29,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:53:29,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:53:29,050 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:53:29,059 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:53:29,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:53:29,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:53:29,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:53:29,060 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:53:29,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:53:29,060 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:53:29,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:53:29,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:53:29,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:53:29,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:53:29,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:53:29,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:53:29,061 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:53:29,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:53:29,061 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:53:29,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:53:29,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:53:29,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:53:29,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:53:29,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:53:29,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:53:29,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:53:29,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:53:29,062 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:53:29,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:53:29,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:53:29,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:53:29,063 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:53:29,063 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_947f9dd3-414b-442b-9f11-203f344b36a0/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 -> 0b14062a43b2ee92a3ad64a2a77645ba6654a627 [2019-12-07 17:53:29,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:53:29,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:53:29,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:53:29,178 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:53:29,179 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:53:29,179 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix001_pso.opt.i [2019-12-07 17:53:29,218 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/bin/uautomizer/data/6cc693bb2/1361b636e65c47de9fa9af0285be57a5/FLAG0fb5b912d [2019-12-07 17:53:29,683 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:53:29,684 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/sv-benchmarks/c/pthread-wmm/mix001_pso.opt.i [2019-12-07 17:53:29,694 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/bin/uautomizer/data/6cc693bb2/1361b636e65c47de9fa9af0285be57a5/FLAG0fb5b912d [2019-12-07 17:53:29,703 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/bin/uautomizer/data/6cc693bb2/1361b636e65c47de9fa9af0285be57a5 [2019-12-07 17:53:29,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:53:29,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:53:29,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:53:29,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:53:29,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:53:29,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:53:29" (1/1) ... [2019-12-07 17:53:29,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3482028c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:29, skipping insertion in model container [2019-12-07 17:53:29,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:53:29" (1/1) ... [2019-12-07 17:53:29,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:53:29,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:53:30,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:53:30,012 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:53:30,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:53:30,103 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:53:30,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30 WrapperNode [2019-12-07 17:53:30,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:53:30,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:53:30,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:53:30,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:53:30,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30" (1/1) ... [2019-12-07 17:53:30,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30" (1/1) ... [2019-12-07 17:53:30,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:53:30,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:53:30,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:53:30,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:53:30,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30" (1/1) ... [2019-12-07 17:53:30,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30" (1/1) ... [2019-12-07 17:53:30,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30" (1/1) ... [2019-12-07 17:53:30,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30" (1/1) ... [2019-12-07 17:53:30,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30" (1/1) ... [2019-12-07 17:53:30,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30" (1/1) ... [2019-12-07 17:53:30,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30" (1/1) ... [2019-12-07 17:53:30,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:53:30,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:53:30,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:53:30,185 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:53:30,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/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 17:53:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:53:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:53:30,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:53:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:53:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:53:30,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:53:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:53:30,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:53:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:53:30,233 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:53:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:53:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:53:30,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:53:30,235 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 17:53:30,624 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:53:30,624 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:53:30,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:53:30 BoogieIcfgContainer [2019-12-07 17:53:30,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:53:30,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:53:30,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:53:30,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:53:30,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:53:29" (1/3) ... [2019-12-07 17:53:30,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388bbaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:53:30, skipping insertion in model container [2019-12-07 17:53:30,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:53:30" (2/3) ... [2019-12-07 17:53:30,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388bbaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:53:30, skipping insertion in model container [2019-12-07 17:53:30,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:53:30" (3/3) ... [2019-12-07 17:53:30,630 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_pso.opt.i [2019-12-07 17:53:30,636 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:53:30,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:53:30,641 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:53:30,642 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:53:30,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,672 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,672 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,684 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,684 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,685 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,685 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,685 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:53:30,709 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:53:30,722 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:53:30,722 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:53:30,722 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:53:30,722 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:53:30,722 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:53:30,722 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:53:30,722 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:53:30,722 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:53:30,733 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-07 17:53:30,734 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 17:53:30,796 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 17:53:30,796 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:53:30,811 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 910 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 17:53:30,831 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-07 17:53:30,869 INFO L134 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-07 17:53:30,869 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:53:30,877 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 910 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 17:53:30,901 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 17:53:30,902 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:53:34,350 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 17:53:34,661 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 17:53:34,780 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124432 [2019-12-07 17:53:34,781 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-07 17:53:34,783 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-07 17:53:37,577 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-07 17:53:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-07 17:53:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:53:37,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:53:37,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:53:37,583 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 17:53:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:53:37,587 INFO L82 PathProgramCache]: Analyzing trace with hash -614729650, now seen corresponding path program 1 times [2019-12-07 17:53:37,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:53:37,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906264276] [2019-12-07 17:53:37,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:53:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:53:37,741 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 17:53:37,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906264276] [2019-12-07 17:53:37,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:53:37,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:53:37,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265423302] [2019-12-07 17:53:37,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:53:37,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:53:37,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:53:37,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:53:37,756 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-07 17:53:38,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:53:38,113 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-07 17:53:38,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:53:38,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 17:53:38,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:53:38,385 INFO L225 Difference]: With dead ends: 44562 [2019-12-07 17:53:38,385 INFO L226 Difference]: Without dead ends: 41502 [2019-12-07 17:53:38,386 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 17:53:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-07 17:53:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-07 17:53:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-07 17:53:40,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-07 17:53:40,051 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-07 17:53:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:53:40,053 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-07 17:53:40,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:53:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-07 17:53:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:53:40,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:53:40,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:53:40,057 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 17:53:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:53:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash 652997656, now seen corresponding path program 1 times [2019-12-07 17:53:40,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:53:40,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319018943] [2019-12-07 17:53:40,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:53:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:53:40,116 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 17:53:40,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319018943] [2019-12-07 17:53:40,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:53:40,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:53:40,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789651524] [2019-12-07 17:53:40,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:53:40,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:53:40,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:53:40,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:53:40,118 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-07 17:53:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:53:40,631 INFO L93 Difference]: Finished difference Result 66122 states and 260012 transitions. [2019-12-07 17:53:40,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:53:40,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:53:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:53:40,797 INFO L225 Difference]: With dead ends: 66122 [2019-12-07 17:53:40,797 INFO L226 Difference]: Without dead ends: 66092 [2019-12-07 17:53:40,798 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 17:53:41,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66092 states. [2019-12-07 17:53:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 64446. [2019-12-07 17:53:42,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64446 states. [2019-12-07 17:53:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64446 states to 64446 states and 254822 transitions. [2019-12-07 17:53:42,697 INFO L78 Accepts]: Start accepts. Automaton has 64446 states and 254822 transitions. Word has length 13 [2019-12-07 17:53:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:53:42,697 INFO L462 AbstractCegarLoop]: Abstraction has 64446 states and 254822 transitions. [2019-12-07 17:53:42,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:53:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 64446 states and 254822 transitions. [2019-12-07 17:53:42,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:53:42,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:53:42,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:53:42,701 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 17:53:42,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:53:42,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1079576864, now seen corresponding path program 1 times [2019-12-07 17:53:42,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:53:42,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102526332] [2019-12-07 17:53:42,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:53:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:53:42,748 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 17:53:42,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102526332] [2019-12-07 17:53:42,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:53:42,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:53:42,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100795910] [2019-12-07 17:53:42,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:53:42,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:53:42,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:53:42,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:53:42,750 INFO L87 Difference]: Start difference. First operand 64446 states and 254822 transitions. Second operand 4 states. [2019-12-07 17:53:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:53:43,210 INFO L93 Difference]: Finished difference Result 82254 states and 320688 transitions. [2019-12-07 17:53:43,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:53:43,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 17:53:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:53:43,391 INFO L225 Difference]: With dead ends: 82254 [2019-12-07 17:53:43,391 INFO L226 Difference]: Without dead ends: 82226 [2019-12-07 17:53:43,391 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 17:53:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82226 states. [2019-12-07 17:53:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82226 to 73414. [2019-12-07 17:53:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73414 states. [2019-12-07 17:53:46,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73414 states to 73414 states and 288912 transitions. [2019-12-07 17:53:46,437 INFO L78 Accepts]: Start accepts. Automaton has 73414 states and 288912 transitions. Word has length 16 [2019-12-07 17:53:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:53:46,437 INFO L462 AbstractCegarLoop]: Abstraction has 73414 states and 288912 transitions. [2019-12-07 17:53:46,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:53:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 73414 states and 288912 transitions. [2019-12-07 17:53:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:53:46,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:53:46,445 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 17:53:46,445 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 17:53:46,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:53:46,445 INFO L82 PathProgramCache]: Analyzing trace with hash -624278653, now seen corresponding path program 1 times [2019-12-07 17:53:46,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:53:46,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785842024] [2019-12-07 17:53:46,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:53:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:53:46,493 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 17:53:46,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785842024] [2019-12-07 17:53:46,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:53:46,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:53:46,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955825819] [2019-12-07 17:53:46,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:53:46,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:53:46,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:53:46,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:53:46,495 INFO L87 Difference]: Start difference. First operand 73414 states and 288912 transitions. Second operand 3 states. [2019-12-07 17:53:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:53:46,758 INFO L93 Difference]: Finished difference Result 68874 states and 270636 transitions. [2019-12-07 17:53:46,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:53:46,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:53:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:53:46,909 INFO L225 Difference]: With dead ends: 68874 [2019-12-07 17:53:46,909 INFO L226 Difference]: Without dead ends: 68874 [2019-12-07 17:53:46,910 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 17:53:47,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68874 states. [2019-12-07 17:53:48,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68874 to 68874. [2019-12-07 17:53:48,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68874 states. [2019-12-07 17:53:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68874 states to 68874 states and 270636 transitions. [2019-12-07 17:53:48,702 INFO L78 Accepts]: Start accepts. Automaton has 68874 states and 270636 transitions. Word has length 18 [2019-12-07 17:53:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:53:48,703 INFO L462 AbstractCegarLoop]: Abstraction has 68874 states and 270636 transitions. [2019-12-07 17:53:48,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:53:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 68874 states and 270636 transitions. [2019-12-07 17:53:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:53:48,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:53:48,717 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 17:53:48,717 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 17:53:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:53:48,717 INFO L82 PathProgramCache]: Analyzing trace with hash -482510294, now seen corresponding path program 1 times [2019-12-07 17:53:48,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:53:48,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315779433] [2019-12-07 17:53:48,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:53:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:53:48,774 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 17:53:48,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315779433] [2019-12-07 17:53:48,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:53:48,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:53:48,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983743601] [2019-12-07 17:53:48,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:53:48,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:53:48,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:53:48,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:53:48,775 INFO L87 Difference]: Start difference. First operand 68874 states and 270636 transitions. Second operand 5 states. [2019-12-07 17:53:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:53:49,426 INFO L93 Difference]: Finished difference Result 81922 states and 317702 transitions. [2019-12-07 17:53:49,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:53:49,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 17:53:49,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:53:49,601 INFO L225 Difference]: With dead ends: 81922 [2019-12-07 17:53:49,601 INFO L226 Difference]: Without dead ends: 81870 [2019-12-07 17:53:49,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 17:53:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81870 states. [2019-12-07 17:53:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81870 to 68462. [2019-12-07 17:53:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68462 states. [2019-12-07 17:53:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68462 states to 68462 states and 269172 transitions. [2019-12-07 17:53:51,486 INFO L78 Accepts]: Start accepts. Automaton has 68462 states and 269172 transitions. Word has length 22 [2019-12-07 17:53:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:53:51,486 INFO L462 AbstractCegarLoop]: Abstraction has 68462 states and 269172 transitions. [2019-12-07 17:53:51,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:53:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 68462 states and 269172 transitions. [2019-12-07 17:53:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 17:53:51,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:53:51,555 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] [2019-12-07 17:53:51,555 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 17:53:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:53:51,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1940822117, now seen corresponding path program 1 times [2019-12-07 17:53:51,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:53:51,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131372246] [2019-12-07 17:53:51,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:53:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:53:51,610 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 17:53:51,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131372246] [2019-12-07 17:53:51,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:53:51,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:53:51,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15108366] [2019-12-07 17:53:51,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:53:51,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:53:51,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:53:51,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:53:51,611 INFO L87 Difference]: Start difference. First operand 68462 states and 269172 transitions. Second operand 3 states. [2019-12-07 17:53:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:53:51,899 INFO L93 Difference]: Finished difference Result 68462 states and 266022 transitions. [2019-12-07 17:53:51,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:53:51,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 17:53:51,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:53:52,043 INFO L225 Difference]: With dead ends: 68462 [2019-12-07 17:53:52,043 INFO L226 Difference]: Without dead ends: 68462 [2019-12-07 17:53:52,043 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 17:53:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68462 states. [2019-12-07 17:53:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68462 to 68302. [2019-12-07 17:53:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68302 states. [2019-12-07 17:53:53,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68302 states to 68302 states and 265518 transitions. [2019-12-07 17:53:53,794 INFO L78 Accepts]: Start accepts. Automaton has 68302 states and 265518 transitions. Word has length 32 [2019-12-07 17:53:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:53:53,794 INFO L462 AbstractCegarLoop]: Abstraction has 68302 states and 265518 transitions. [2019-12-07 17:53:53,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:53:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 68302 states and 265518 transitions. [2019-12-07 17:53:53,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:53:53,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:53:53,854 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 17:53:53,854 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 17:53:53,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:53:53,855 INFO L82 PathProgramCache]: Analyzing trace with hash 325215007, now seen corresponding path program 1 times [2019-12-07 17:53:53,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:53:53,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314553617] [2019-12-07 17:53:53,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:53:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:53:53,920 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 17:53:53,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314553617] [2019-12-07 17:53:53,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:53:53,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:53:53,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883548963] [2019-12-07 17:53:53,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:53:53,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:53:53,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:53:53,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:53:53,921 INFO L87 Difference]: Start difference. First operand 68302 states and 265518 transitions. Second operand 5 states. [2019-12-07 17:53:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:53:54,412 INFO L93 Difference]: Finished difference Result 95302 states and 375926 transitions. [2019-12-07 17:53:54,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:53:54,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 17:53:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:53:54,618 INFO L225 Difference]: With dead ends: 95302 [2019-12-07 17:53:54,618 INFO L226 Difference]: Without dead ends: 95302 [2019-12-07 17:53:54,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:53:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95302 states. [2019-12-07 17:53:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95302 to 92742. [2019-12-07 17:53:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92742 states. [2019-12-07 17:53:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92742 states to 92742 states and 366722 transitions. [2019-12-07 17:53:56,879 INFO L78 Accepts]: Start accepts. Automaton has 92742 states and 366722 transitions. Word has length 33 [2019-12-07 17:53:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:53:56,879 INFO L462 AbstractCegarLoop]: Abstraction has 92742 states and 366722 transitions. [2019-12-07 17:53:56,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:53:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 92742 states and 366722 transitions. [2019-12-07 17:53:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:53:56,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:53:56,972 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 17:53:56,973 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 17:53:56,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:53:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash 249335433, now seen corresponding path program 2 times [2019-12-07 17:53:56,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:53:56,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415615175] [2019-12-07 17:53:56,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:53:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:53:57,039 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 17:53:57,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415615175] [2019-12-07 17:53:57,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:53:57,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:53:57,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600830501] [2019-12-07 17:53:57,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:53:57,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:53:57,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:53:57,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:53:57,041 INFO L87 Difference]: Start difference. First operand 92742 states and 366722 transitions. Second operand 6 states. [2019-12-07 17:53:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:53:57,838 INFO L93 Difference]: Finished difference Result 141834 states and 557957 transitions. [2019-12-07 17:53:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:53:57,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 17:53:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:53:58,167 INFO L225 Difference]: With dead ends: 141834 [2019-12-07 17:53:58,168 INFO L226 Difference]: Without dead ends: 141834 [2019-12-07 17:53:58,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:53:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141834 states. [2019-12-07 17:54:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141834 to 105544. [2019-12-07 17:54:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105544 states. [2019-12-07 17:54:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105544 states to 105544 states and 417105 transitions. [2019-12-07 17:54:01,089 INFO L78 Accepts]: Start accepts. Automaton has 105544 states and 417105 transitions. Word has length 33 [2019-12-07 17:54:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:01,090 INFO L462 AbstractCegarLoop]: Abstraction has 105544 states and 417105 transitions. [2019-12-07 17:54:01,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:54:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 105544 states and 417105 transitions. [2019-12-07 17:54:01,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:54:01,188 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:01,188 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 17:54:01,188 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 17:54:01,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:01,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1278511281, now seen corresponding path program 3 times [2019-12-07 17:54:01,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:01,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812897552] [2019-12-07 17:54:01,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:01,244 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 17:54:01,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812897552] [2019-12-07 17:54:01,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:01,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:54:01,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732902537] [2019-12-07 17:54:01,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:54:01,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:01,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:54:01,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:54:01,246 INFO L87 Difference]: Start difference. First operand 105544 states and 417105 transitions. Second operand 4 states. [2019-12-07 17:54:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:01,686 INFO L93 Difference]: Finished difference Result 105492 states and 416925 transitions. [2019-12-07 17:54:01,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:54:01,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 17:54:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:01,936 INFO L225 Difference]: With dead ends: 105492 [2019-12-07 17:54:01,936 INFO L226 Difference]: Without dead ends: 105492 [2019-12-07 17:54:01,937 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 17:54:02,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105492 states. [2019-12-07 17:54:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105492 to 105444. [2019-12-07 17:54:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105444 states. [2019-12-07 17:54:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105444 states to 105444 states and 416761 transitions. [2019-12-07 17:54:04,432 INFO L78 Accepts]: Start accepts. Automaton has 105444 states and 416761 transitions. Word has length 33 [2019-12-07 17:54:04,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:04,432 INFO L462 AbstractCegarLoop]: Abstraction has 105444 states and 416761 transitions. [2019-12-07 17:54:04,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:54:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 105444 states and 416761 transitions. [2019-12-07 17:54:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:54:04,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:04,539 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 17:54:04,539 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 17:54:04,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash -122730864, now seen corresponding path program 1 times [2019-12-07 17:54:04,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:04,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401805157] [2019-12-07 17:54:04,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:04,597 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 17:54:04,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401805157] [2019-12-07 17:54:04,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:04,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:54:04,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382435460] [2019-12-07 17:54:04,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:54:04,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:04,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:54:04,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:54:04,598 INFO L87 Difference]: Start difference. First operand 105444 states and 416761 transitions. Second operand 4 states. [2019-12-07 17:54:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:05,015 INFO L93 Difference]: Finished difference Result 104650 states and 413392 transitions. [2019-12-07 17:54:05,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:54:05,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 17:54:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:05,258 INFO L225 Difference]: With dead ends: 104650 [2019-12-07 17:54:05,258 INFO L226 Difference]: Without dead ends: 104650 [2019-12-07 17:54:05,258 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 17:54:06,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104650 states. [2019-12-07 17:54:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104650 to 103554. [2019-12-07 17:54:07,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103554 states. [2019-12-07 17:54:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103554 states to 103554 states and 408798 transitions. [2019-12-07 17:54:07,719 INFO L78 Accepts]: Start accepts. Automaton has 103554 states and 408798 transitions. Word has length 34 [2019-12-07 17:54:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:07,719 INFO L462 AbstractCegarLoop]: Abstraction has 103554 states and 408798 transitions. [2019-12-07 17:54:07,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:54:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 103554 states and 408798 transitions. [2019-12-07 17:54:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:54:07,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:07,827 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 17:54:07,828 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 17:54:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:07,828 INFO L82 PathProgramCache]: Analyzing trace with hash -22818902, now seen corresponding path program 1 times [2019-12-07 17:54:07,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:07,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90715816] [2019-12-07 17:54:07,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:07,879 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 17:54:07,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90715816] [2019-12-07 17:54:07,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:07,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:54:07,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210014722] [2019-12-07 17:54:07,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:54:07,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:07,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:54:07,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:54:07,880 INFO L87 Difference]: Start difference. First operand 103554 states and 408798 transitions. Second operand 4 states. [2019-12-07 17:54:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:08,473 INFO L93 Difference]: Finished difference Result 106396 states and 414693 transitions. [2019-12-07 17:54:08,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:54:08,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 17:54:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:08,722 INFO L225 Difference]: With dead ends: 106396 [2019-12-07 17:54:08,722 INFO L226 Difference]: Without dead ends: 106396 [2019-12-07 17:54:08,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 17:54:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106396 states. [2019-12-07 17:54:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106396 to 104236. [2019-12-07 17:54:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104236 states. [2019-12-07 17:54:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104236 states to 104236 states and 406707 transitions. [2019-12-07 17:54:11,291 INFO L78 Accepts]: Start accepts. Automaton has 104236 states and 406707 transitions. Word has length 35 [2019-12-07 17:54:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:11,291 INFO L462 AbstractCegarLoop]: Abstraction has 104236 states and 406707 transitions. [2019-12-07 17:54:11,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:54:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 104236 states and 406707 transitions. [2019-12-07 17:54:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:54:11,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:11,398 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 17:54:11,398 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 17:54:11,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:11,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2057692010, now seen corresponding path program 2 times [2019-12-07 17:54:11,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:11,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813257979] [2019-12-07 17:54:11,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:11,458 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 17:54:11,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813257979] [2019-12-07 17:54:11,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:11,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:54:11,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404652998] [2019-12-07 17:54:11,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:54:11,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:11,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:54:11,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:54:11,459 INFO L87 Difference]: Start difference. First operand 104236 states and 406707 transitions. Second operand 7 states. [2019-12-07 17:54:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:12,297 INFO L93 Difference]: Finished difference Result 157181 states and 607720 transitions. [2019-12-07 17:54:12,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:54:12,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 17:54:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:12,623 INFO L225 Difference]: With dead ends: 157181 [2019-12-07 17:54:12,623 INFO L226 Difference]: Without dead ends: 143025 [2019-12-07 17:54:12,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:54:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143025 states. [2019-12-07 17:54:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143025 to 109268. [2019-12-07 17:54:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109268 states. [2019-12-07 17:54:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109268 states to 109268 states and 425665 transitions. [2019-12-07 17:54:15,585 INFO L78 Accepts]: Start accepts. Automaton has 109268 states and 425665 transitions. Word has length 35 [2019-12-07 17:54:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:15,586 INFO L462 AbstractCegarLoop]: Abstraction has 109268 states and 425665 transitions. [2019-12-07 17:54:15,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:54:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 109268 states and 425665 transitions. [2019-12-07 17:54:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:54:15,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:15,700 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 17:54:15,701 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 17:54:15,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1617582808, now seen corresponding path program 3 times [2019-12-07 17:54:15,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:15,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454550733] [2019-12-07 17:54:15,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:15,799 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 17:54:15,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454550733] [2019-12-07 17:54:15,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:15,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:54:15,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5876888] [2019-12-07 17:54:15,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:54:15,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:15,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:54:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:54:15,800 INFO L87 Difference]: Start difference. First operand 109268 states and 425665 transitions. Second operand 9 states. [2019-12-07 17:54:16,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:16,933 INFO L93 Difference]: Finished difference Result 129992 states and 509130 transitions. [2019-12-07 17:54:16,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:54:16,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 17:54:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:17,233 INFO L225 Difference]: With dead ends: 129992 [2019-12-07 17:54:17,233 INFO L226 Difference]: Without dead ends: 129992 [2019-12-07 17:54:17,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:54:18,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129992 states. [2019-12-07 17:54:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129992 to 126470. [2019-12-07 17:54:19,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126470 states. [2019-12-07 17:54:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126470 states to 126470 states and 496016 transitions. [2019-12-07 17:54:20,252 INFO L78 Accepts]: Start accepts. Automaton has 126470 states and 496016 transitions. Word has length 35 [2019-12-07 17:54:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:20,252 INFO L462 AbstractCegarLoop]: Abstraction has 126470 states and 496016 transitions. [2019-12-07 17:54:20,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:54:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 126470 states and 496016 transitions. [2019-12-07 17:54:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:54:20,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:20,390 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 17:54:20,390 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 17:54:20,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:20,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1222686184, now seen corresponding path program 4 times [2019-12-07 17:54:20,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:20,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701779694] [2019-12-07 17:54:20,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:20,499 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 17:54:20,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701779694] [2019-12-07 17:54:20,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:20,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:54:20,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139649722] [2019-12-07 17:54:20,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:54:20,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:20,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:54:20,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:54:20,500 INFO L87 Difference]: Start difference. First operand 126470 states and 496016 transitions. Second operand 9 states. [2019-12-07 17:54:21,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:21,873 INFO L93 Difference]: Finished difference Result 201065 states and 791497 transitions. [2019-12-07 17:54:21,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:54:21,874 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-07 17:54:21,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:22,297 INFO L225 Difference]: With dead ends: 201065 [2019-12-07 17:54:22,297 INFO L226 Difference]: Without dead ends: 191081 [2019-12-07 17:54:22,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:54:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191081 states. [2019-12-07 17:54:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191081 to 124522. [2019-12-07 17:54:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124522 states. [2019-12-07 17:54:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124522 states to 124522 states and 488100 transitions. [2019-12-07 17:54:27,950 INFO L78 Accepts]: Start accepts. Automaton has 124522 states and 488100 transitions. Word has length 35 [2019-12-07 17:54:27,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:27,951 INFO L462 AbstractCegarLoop]: Abstraction has 124522 states and 488100 transitions. [2019-12-07 17:54:27,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:54:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 124522 states and 488100 transitions. [2019-12-07 17:54:28,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:54:28,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:28,079 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 17:54:28,079 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 17:54:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:28,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1178465098, now seen corresponding path program 5 times [2019-12-07 17:54:28,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:28,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610265560] [2019-12-07 17:54:28,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:28,211 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 17:54:28,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610265560] [2019-12-07 17:54:28,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:28,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:54:28,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919116735] [2019-12-07 17:54:28,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:54:28,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:28,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:54:28,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:54:28,212 INFO L87 Difference]: Start difference. First operand 124522 states and 488100 transitions. Second operand 11 states. [2019-12-07 17:54:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:30,079 INFO L93 Difference]: Finished difference Result 174314 states and 687478 transitions. [2019-12-07 17:54:30,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:54:30,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-12-07 17:54:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:30,474 INFO L225 Difference]: With dead ends: 174314 [2019-12-07 17:54:30,474 INFO L226 Difference]: Without dead ends: 164978 [2019-12-07 17:54:30,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:54:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164978 states. [2019-12-07 17:54:33,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164978 to 116070. [2019-12-07 17:54:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116070 states. [2019-12-07 17:54:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116070 states to 116070 states and 453046 transitions. [2019-12-07 17:54:33,649 INFO L78 Accepts]: Start accepts. Automaton has 116070 states and 453046 transitions. Word has length 35 [2019-12-07 17:54:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:33,649 INFO L462 AbstractCegarLoop]: Abstraction has 116070 states and 453046 transitions. [2019-12-07 17:54:33,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:54:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 116070 states and 453046 transitions. [2019-12-07 17:54:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:54:33,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:33,779 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] [2019-12-07 17:54:33,780 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 17:54:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1952510451, now seen corresponding path program 1 times [2019-12-07 17:54:33,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:33,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835964874] [2019-12-07 17:54:33,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:33,826 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 17:54:33,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835964874] [2019-12-07 17:54:33,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:33,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:54:33,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260747326] [2019-12-07 17:54:33,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:54:33,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:33,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:54:33,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:54:33,828 INFO L87 Difference]: Start difference. First operand 116070 states and 453046 transitions. Second operand 5 states. [2019-12-07 17:54:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:33,890 INFO L93 Difference]: Finished difference Result 11205 states and 36823 transitions. [2019-12-07 17:54:33,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:54:33,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 17:54:33,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:33,899 INFO L225 Difference]: With dead ends: 11205 [2019-12-07 17:54:33,899 INFO L226 Difference]: Without dead ends: 6473 [2019-12-07 17:54:33,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:54:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6473 states. [2019-12-07 17:54:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6473 to 6473. [2019-12-07 17:54:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6473 states. [2019-12-07 17:54:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6473 states to 6473 states and 18110 transitions. [2019-12-07 17:54:33,970 INFO L78 Accepts]: Start accepts. Automaton has 6473 states and 18110 transitions. Word has length 36 [2019-12-07 17:54:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:33,970 INFO L462 AbstractCegarLoop]: Abstraction has 6473 states and 18110 transitions. [2019-12-07 17:54:33,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:54:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6473 states and 18110 transitions. [2019-12-07 17:54:33,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:54:33,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:33,974 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 17:54:33,974 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 17:54:33,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:33,975 INFO L82 PathProgramCache]: Analyzing trace with hash -492468280, now seen corresponding path program 1 times [2019-12-07 17:54:33,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:33,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393501979] [2019-12-07 17:54:33,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:34,186 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 17:54:34,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393501979] [2019-12-07 17:54:34,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:34,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:54:34,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365041377] [2019-12-07 17:54:34,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:54:34,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:34,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:54:34,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:54:34,187 INFO L87 Difference]: Start difference. First operand 6473 states and 18110 transitions. Second operand 9 states. [2019-12-07 17:54:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:35,310 INFO L93 Difference]: Finished difference Result 13521 states and 34499 transitions. [2019-12-07 17:54:35,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:54:35,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-12-07 17:54:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:35,321 INFO L225 Difference]: With dead ends: 13521 [2019-12-07 17:54:35,321 INFO L226 Difference]: Without dead ends: 12889 [2019-12-07 17:54:35,321 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 17:54:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12889 states. [2019-12-07 17:54:35,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12889 to 9143. [2019-12-07 17:54:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2019-12-07 17:54:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 24817 transitions. [2019-12-07 17:54:35,437 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 24817 transitions. Word has length 47 [2019-12-07 17:54:35,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:35,438 INFO L462 AbstractCegarLoop]: Abstraction has 9143 states and 24817 transitions. [2019-12-07 17:54:35,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:54:35,438 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 24817 transitions. [2019-12-07 17:54:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:54:35,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:35,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, 1] [2019-12-07 17:54:35,445 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 17:54:35,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1618395182, now seen corresponding path program 2 times [2019-12-07 17:54:35,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:35,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115610032] [2019-12-07 17:54:35,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:35,572 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 17:54:35,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115610032] [2019-12-07 17:54:35,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:35,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:54:35,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561133874] [2019-12-07 17:54:35,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:54:35,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:35,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:54:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:54:35,573 INFO L87 Difference]: Start difference. First operand 9143 states and 24817 transitions. Second operand 10 states. [2019-12-07 17:54:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:36,293 INFO L93 Difference]: Finished difference Result 12218 states and 32419 transitions. [2019-12-07 17:54:36,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:54:36,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-12-07 17:54:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:36,301 INFO L225 Difference]: With dead ends: 12218 [2019-12-07 17:54:36,301 INFO L226 Difference]: Without dead ends: 9101 [2019-12-07 17:54:36,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:54:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9101 states. [2019-12-07 17:54:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9101 to 6468. [2019-12-07 17:54:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6468 states. [2019-12-07 17:54:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6468 states to 6468 states and 18029 transitions. [2019-12-07 17:54:36,385 INFO L78 Accepts]: Start accepts. Automaton has 6468 states and 18029 transitions. Word has length 47 [2019-12-07 17:54:36,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:36,386 INFO L462 AbstractCegarLoop]: Abstraction has 6468 states and 18029 transitions. [2019-12-07 17:54:36,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:54:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 6468 states and 18029 transitions. [2019-12-07 17:54:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:54:36,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:36,391 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 17:54:36,391 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:54:36,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:36,391 INFO L82 PathProgramCache]: Analyzing trace with hash -109708298, now seen corresponding path program 3 times [2019-12-07 17:54:36,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:36,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425244429] [2019-12-07 17:54:36,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:36,446 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 17:54:36,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425244429] [2019-12-07 17:54:36,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:36,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:54:36,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475673368] [2019-12-07 17:54:36,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:54:36,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:36,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:54:36,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:54:36,447 INFO L87 Difference]: Start difference. First operand 6468 states and 18029 transitions. Second operand 6 states. [2019-12-07 17:54:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:36,496 INFO L93 Difference]: Finished difference Result 4995 states and 14690 transitions. [2019-12-07 17:54:36,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:54:36,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-07 17:54:36,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:36,499 INFO L225 Difference]: With dead ends: 4995 [2019-12-07 17:54:36,499 INFO L226 Difference]: Without dead ends: 2922 [2019-12-07 17:54:36,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:54:36,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2019-12-07 17:54:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2910. [2019-12-07 17:54:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2910 states. [2019-12-07 17:54:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 7595 transitions. [2019-12-07 17:54:36,526 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 7595 transitions. Word has length 47 [2019-12-07 17:54:36,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:36,526 INFO L462 AbstractCegarLoop]: Abstraction has 2910 states and 7595 transitions. [2019-12-07 17:54:36,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:54:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 7595 transitions. [2019-12-07 17:54:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:54:36,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:36,528 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] [2019-12-07 17:54:36,528 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:54:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash -107738299, now seen corresponding path program 1 times [2019-12-07 17:54:36,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:36,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141423745] [2019-12-07 17:54:36,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:36,564 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 17:54:36,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141423745] [2019-12-07 17:54:36,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:36,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:54:36,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207064829] [2019-12-07 17:54:36,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:54:36,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:36,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:54:36,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:54:36,566 INFO L87 Difference]: Start difference. First operand 2910 states and 7595 transitions. Second operand 4 states. [2019-12-07 17:54:36,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:36,585 INFO L93 Difference]: Finished difference Result 3284 states and 8453 transitions. [2019-12-07 17:54:36,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:54:36,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 17:54:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:36,586 INFO L225 Difference]: With dead ends: 3284 [2019-12-07 17:54:36,586 INFO L226 Difference]: Without dead ends: 437 [2019-12-07 17:54:36,586 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 17:54:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-07 17:54:36,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-12-07 17:54:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-07 17:54:36,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 952 transitions. [2019-12-07 17:54:36,590 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 952 transitions. Word has length 62 [2019-12-07 17:54:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:36,590 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 952 transitions. [2019-12-07 17:54:36,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:54:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 952 transitions. [2019-12-07 17:54:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:54:36,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:36,591 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 17:54:36,591 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:54:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:36,591 INFO L82 PathProgramCache]: Analyzing trace with hash -496292372, now seen corresponding path program 1 times [2019-12-07 17:54:36,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:36,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985583296] [2019-12-07 17:54:36,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:54:36,669 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 17:54:36,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985583296] [2019-12-07 17:54:36,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:54:36,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:54:36,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205185612] [2019-12-07 17:54:36,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:54:36,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:54:36,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:54:36,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:54:36,671 INFO L87 Difference]: Start difference. First operand 437 states and 952 transitions. Second operand 8 states. [2019-12-07 17:54:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:54:36,833 INFO L93 Difference]: Finished difference Result 943 states and 2020 transitions. [2019-12-07 17:54:36,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:54:36,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 17:54:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:54:36,834 INFO L225 Difference]: With dead ends: 943 [2019-12-07 17:54:36,834 INFO L226 Difference]: Without dead ends: 692 [2019-12-07 17:54:36,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:54:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-12-07 17:54:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 528. [2019-12-07 17:54:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-12-07 17:54:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1115 transitions. [2019-12-07 17:54:36,838 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1115 transitions. Word has length 63 [2019-12-07 17:54:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:54:36,839 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 1115 transitions. [2019-12-07 17:54:36,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:54:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1115 transitions. [2019-12-07 17:54:36,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:54:36,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:54:36,840 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 17:54:36,840 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:54:36,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:54:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2092088660, now seen corresponding path program 2 times [2019-12-07 17:54:36,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:54:36,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521043085] [2019-12-07 17:54:36,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:54:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:54:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:54:36,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:54:36,916 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:54:36,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t23~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t23~0.base_112|) |v_ULTIMATE.start_main_~#t23~0.offset_63| 0)) |v_#memory_int_21|) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t23~0.base_112|) 0) (= v_~z~0_33 0) (= |v_ULTIMATE.start_main_~#t23~0.offset_63| 0) (= 0 v_~weak$$choice0~0_268) (= v_~y$w_buff1~0_277 0) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t23~0.base_112|) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 v_~y$r_buff1_thd2~0_454) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t23~0.base_112| 4)) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t23~0.base_112| 1) |v_#valid_144|) (= v_~y$r_buff1_thd1~0_236 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_~#t25~0.base=|v_ULTIMATE.start_main_~#t25~0.base_59|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ULTIMATE.start_main_~#t25~0.offset=|v_ULTIMATE.start_main_~#t25~0.offset_36|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~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_461, ULTIMATE.start_main_~#t24~0.base=|v_ULTIMATE.start_main_~#t24~0.base_84|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ~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_977, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ULTIMATE.start_main_~#t23~0.base=|v_ULTIMATE.start_main_~#t23~0.base_112|, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ULTIMATE.start_main_~#t24~0.offset=|v_ULTIMATE.start_main_~#t24~0.offset_36|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_~#t23~0.offset=|v_ULTIMATE.start_main_~#t23~0.offset_63|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t25~0.base, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t25~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_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, ULTIMATE.start_main_~#t24~0.base, ~__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, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t23~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t24~0.offset, ~__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_~#t23~0.offset, 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 17:54:36,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t24~0.base_11|) (= |v_ULTIMATE.start_main_~#t24~0.offset_10| 0) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t24~0.base_11| 1) |v_#valid_32|) (not (= |v_ULTIMATE.start_main_~#t24~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t24~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t24~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t24~0.base_11|) |v_ULTIMATE.start_main_~#t24~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t24~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t24~0.offset=|v_ULTIMATE.start_main_~#t24~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t24~0.base=|v_ULTIMATE.start_main_~#t24~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t24~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t24~0.base, #length] because there is no mapped edge [2019-12-07 17:54:36,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t25~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t25~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t25~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t25~0.base_11|) |v_ULTIMATE.start_main_~#t25~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t25~0.base_11| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t25~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t25~0.offset_10| 0) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t25~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t25~0.base=|v_ULTIMATE.start_main_~#t25~0.base_11|, ULTIMATE.start_main_~#t25~0.offset=|v_ULTIMATE.start_main_~#t25~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t25~0.base, ULTIMATE.start_main_~#t25~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 17:54:36,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_197 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_345 256))))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} 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 17:54:36,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In310158663 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In310158663 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out310158663| ~y$w_buff0~0_In310158663) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out310158663| ~y$w_buff1~0_In310158663) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In310158663, ~y$w_buff1~0=~y$w_buff1~0_In310158663, ~y$w_buff0~0=~y$w_buff0~0_In310158663, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In310158663} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out310158663|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In310158663, ~y$w_buff1~0=~y$w_buff1~0_In310158663, ~y$w_buff0~0=~y$w_buff0~0_In310158663, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In310158663} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:54:36,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |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_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 17:54:36,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_41} 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 17:54:36,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In661154619 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out661154619| ~y$mem_tmp~0_In661154619)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out661154619| ~y~0_In661154619)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In661154619, ~y$flush_delayed~0=~y$flush_delayed~0_In661154619, ~y~0=~y~0_In661154619} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out661154619|, ~y$mem_tmp~0=~y$mem_tmp~0_In661154619, ~y$flush_delayed~0=~y$flush_delayed~0_In661154619, ~y~0=~y~0_In661154619} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 17:54:36,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_8) (= v_P0Thread1of1ForFork1_~arg.offset_8 |v_P0Thread1of1ForFork1_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~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 17:54:36,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1651962867 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1651962867 256) 0))) (or (and (= ~y$w_buff0_used~0_In1651962867 |P2Thread1of1ForFork0_#t~ite51_Out1651962867|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1651962867|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1651962867, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1651962867} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1651962867, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1651962867, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1651962867|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 17:54:36,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1805249689 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1805249689 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1805249689 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1805249689 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out1805249689| ~y$w_buff1_used~0_In1805249689) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out1805249689| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1805249689, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1805249689, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1805249689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1805249689} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1805249689, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1805249689, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1805249689, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1805249689|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1805249689} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 17:54:36,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In988266332 ~y$r_buff0_thd3~0_Out988266332)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In988266332 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In988266332 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= ~y$r_buff0_thd3~0_Out988266332 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In988266332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In988266332} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In988266332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out988266332, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out988266332|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 17:54:36,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-928316566 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-928316566 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-928316566 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-928316566 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite54_Out-928316566| ~y$r_buff1_thd3~0_In-928316566)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite54_Out-928316566| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-928316566, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-928316566, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-928316566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928316566} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-928316566, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-928316566, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-928316566|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-928316566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928316566} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:54:36,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, 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 17:54:36,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1345144837 256) 0))) (or (and (= ~y~0_In-1345144837 |P1Thread1of1ForFork2_#t~ite25_Out-1345144837|) .cse0) (and (not .cse0) (= ~y$mem_tmp~0_In-1345144837 |P1Thread1of1ForFork2_#t~ite25_Out-1345144837|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1345144837, ~y$flush_delayed~0=~y$flush_delayed~0_In-1345144837, ~y~0=~y~0_In-1345144837} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1345144837, ~y$flush_delayed~0=~y$flush_delayed~0_In-1345144837, ~y~0=~y~0_In-1345144837, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1345144837|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:54:36,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= v_~y$flush_delayed~0_261 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} 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 17:54:36,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:54:36,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-222090609 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-222090609 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out-222090609| |ULTIMATE.start_main_#t~ite59_Out-222090609|))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-222090609| ~y$w_buff1~0_In-222090609)) (and (or .cse0 .cse2) .cse1 (= |ULTIMATE.start_main_#t~ite58_Out-222090609| ~y~0_In-222090609)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-222090609, ~y~0=~y~0_In-222090609, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-222090609, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-222090609} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-222090609, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-222090609|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-222090609|, ~y~0=~y~0_In-222090609, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-222090609, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-222090609} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:54:36,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1742051422 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1742051422 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out1742051422|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1742051422 |ULTIMATE.start_main_#t~ite60_Out1742051422|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1742051422, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1742051422} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1742051422|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1742051422, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1742051422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 17:54:36,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In288612122 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In288612122 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In288612122 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In288612122 256) 0))) (or (and (= ~y$w_buff1_used~0_In288612122 |ULTIMATE.start_main_#t~ite61_Out288612122|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite61_Out288612122| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In288612122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In288612122, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In288612122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In288612122} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out288612122|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In288612122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In288612122, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In288612122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In288612122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:54:36,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2097733935 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2097733935 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out2097733935|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In2097733935 |ULTIMATE.start_main_#t~ite62_Out2097733935|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2097733935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2097733935} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2097733935|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2097733935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2097733935} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:54:36,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In184450953 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In184450953 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In184450953 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In184450953 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In184450953 |ULTIMATE.start_main_#t~ite63_Out184450953|)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out184450953|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In184450953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In184450953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In184450953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In184450953} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out184450953|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In184450953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In184450953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In184450953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In184450953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:54:36,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_29 0) (= 1 v_~__unbuffered_p0_EAX~0_29) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 17:54:37,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:54:37 BasicIcfg [2019-12-07 17:54:37,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:54:37,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:54:37,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:54:37,010 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:54:37,010 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:53:30" (3/4) ... [2019-12-07 17:54:37,012 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:54:37,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t23~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t23~0.base_112|) |v_ULTIMATE.start_main_~#t23~0.offset_63| 0)) |v_#memory_int_21|) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t23~0.base_112|) 0) (= v_~z~0_33 0) (= |v_ULTIMATE.start_main_~#t23~0.offset_63| 0) (= 0 v_~weak$$choice0~0_268) (= v_~y$w_buff1~0_277 0) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t23~0.base_112|) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 v_~y$r_buff1_thd2~0_454) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t23~0.base_112| 4)) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t23~0.base_112| 1) |v_#valid_144|) (= v_~y$r_buff1_thd1~0_236 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_~#t25~0.base=|v_ULTIMATE.start_main_~#t25~0.base_59|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ULTIMATE.start_main_~#t25~0.offset=|v_ULTIMATE.start_main_~#t25~0.offset_36|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~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_461, ULTIMATE.start_main_~#t24~0.base=|v_ULTIMATE.start_main_~#t24~0.base_84|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ~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_977, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ULTIMATE.start_main_~#t23~0.base=|v_ULTIMATE.start_main_~#t23~0.base_112|, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ULTIMATE.start_main_~#t24~0.offset=|v_ULTIMATE.start_main_~#t24~0.offset_36|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_~#t23~0.offset=|v_ULTIMATE.start_main_~#t23~0.offset_63|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t25~0.base, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t25~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_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, ULTIMATE.start_main_~#t24~0.base, ~__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, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t23~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t24~0.offset, ~__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_~#t23~0.offset, 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 17:54:37,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t24~0.base_11|) (= |v_ULTIMATE.start_main_~#t24~0.offset_10| 0) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t24~0.base_11| 1) |v_#valid_32|) (not (= |v_ULTIMATE.start_main_~#t24~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t24~0.base_11| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t24~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t24~0.base_11|) |v_ULTIMATE.start_main_~#t24~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t24~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t24~0.offset=|v_ULTIMATE.start_main_~#t24~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t24~0.base=|v_ULTIMATE.start_main_~#t24~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t24~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t24~0.base, #length] because there is no mapped edge [2019-12-07 17:54:37,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t25~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t25~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t25~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t25~0.base_11|) |v_ULTIMATE.start_main_~#t25~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t25~0.base_11| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t25~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t25~0.offset_10| 0) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t25~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t25~0.base=|v_ULTIMATE.start_main_~#t25~0.base_11|, ULTIMATE.start_main_~#t25~0.offset=|v_ULTIMATE.start_main_~#t25~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t25~0.base, ULTIMATE.start_main_~#t25~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 17:54:37,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69)) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_197 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_345 256))))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_67) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_67)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_67, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_67|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_67, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} 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 17:54:37,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In310158663 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In310158663 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out310158663| ~y$w_buff0~0_In310158663) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out310158663| ~y$w_buff1~0_In310158663) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In310158663, ~y$w_buff1~0=~y$w_buff1~0_In310158663, ~y$w_buff0~0=~y$w_buff0~0_In310158663, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In310158663} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out310158663|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In310158663, ~y$w_buff1~0=~y$w_buff1~0_In310158663, ~y$w_buff0~0=~y$w_buff0~0_In310158663, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In310158663} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:54:37,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |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_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 17:54:37,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_5|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_5|, ~weak$$choice2~0=v_~weak$$choice2~0_41} 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 17:54:37,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In661154619 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out661154619| ~y$mem_tmp~0_In661154619)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out661154619| ~y~0_In661154619)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In661154619, ~y$flush_delayed~0=~y$flush_delayed~0_In661154619, ~y~0=~y~0_In661154619} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out661154619|, ~y$mem_tmp~0=~y$mem_tmp~0_In661154619, ~y$flush_delayed~0=~y$flush_delayed~0_In661154619, ~y~0=~y~0_In661154619} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 17:54:37,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_8) (= v_P0Thread1of1ForFork1_~arg.offset_8 |v_P0Thread1of1ForFork1_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~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 17:54:37,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1651962867 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1651962867 256) 0))) (or (and (= ~y$w_buff0_used~0_In1651962867 |P2Thread1of1ForFork0_#t~ite51_Out1651962867|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1651962867|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1651962867, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1651962867} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1651962867, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1651962867, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1651962867|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 17:54:37,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1805249689 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1805249689 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1805249689 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1805249689 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite52_Out1805249689| ~y$w_buff1_used~0_In1805249689) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out1805249689| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1805249689, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1805249689, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1805249689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1805249689} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1805249689, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1805249689, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1805249689, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1805249689|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1805249689} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 17:54:37,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In988266332 ~y$r_buff0_thd3~0_Out988266332)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In988266332 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In988266332 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= ~y$r_buff0_thd3~0_Out988266332 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In988266332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In988266332} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In988266332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out988266332, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out988266332|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 17:54:37,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-928316566 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-928316566 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-928316566 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-928316566 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite54_Out-928316566| ~y$r_buff1_thd3~0_In-928316566)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite54_Out-928316566| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-928316566, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-928316566, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-928316566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928316566} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-928316566, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-928316566, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-928316566|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-928316566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-928316566} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:54:37,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_36|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, 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 17:54:37,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1345144837 256) 0))) (or (and (= ~y~0_In-1345144837 |P1Thread1of1ForFork2_#t~ite25_Out-1345144837|) .cse0) (and (not .cse0) (= ~y$mem_tmp~0_In-1345144837 |P1Thread1of1ForFork2_#t~ite25_Out-1345144837|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1345144837, ~y$flush_delayed~0=~y$flush_delayed~0_In-1345144837, ~y~0=~y~0_In-1345144837} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1345144837, ~y$flush_delayed~0=~y$flush_delayed~0_In-1345144837, ~y~0=~y~0_In-1345144837, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1345144837|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:54:37,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_92|) (= v_~y$flush_delayed~0_261 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_92|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_91|} 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 17:54:37,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:54:37,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-222090609 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-222090609 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite58_Out-222090609| |ULTIMATE.start_main_#t~ite59_Out-222090609|))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite58_Out-222090609| ~y$w_buff1~0_In-222090609)) (and (or .cse0 .cse2) .cse1 (= |ULTIMATE.start_main_#t~ite58_Out-222090609| ~y~0_In-222090609)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-222090609, ~y~0=~y~0_In-222090609, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-222090609, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-222090609} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-222090609, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-222090609|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-222090609|, ~y~0=~y~0_In-222090609, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-222090609, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-222090609} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:54:37,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1742051422 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1742051422 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out1742051422|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1742051422 |ULTIMATE.start_main_#t~ite60_Out1742051422|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1742051422, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1742051422} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1742051422|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1742051422, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1742051422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 17:54:37,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In288612122 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In288612122 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In288612122 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In288612122 256) 0))) (or (and (= ~y$w_buff1_used~0_In288612122 |ULTIMATE.start_main_#t~ite61_Out288612122|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite61_Out288612122| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In288612122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In288612122, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In288612122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In288612122} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out288612122|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In288612122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In288612122, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In288612122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In288612122} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:54:37,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2097733935 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2097733935 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out2097733935|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In2097733935 |ULTIMATE.start_main_#t~ite62_Out2097733935|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2097733935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2097733935} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2097733935|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2097733935, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2097733935} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:54:37,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In184450953 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In184450953 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In184450953 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In184450953 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In184450953 |ULTIMATE.start_main_#t~ite63_Out184450953|)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out184450953|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In184450953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In184450953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In184450953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In184450953} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out184450953|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In184450953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In184450953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In184450953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In184450953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:54:37,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_29 0) (= 1 v_~__unbuffered_p0_EAX~0_29) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1) v_~main$tmp_guard1~0_22) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 17:54:37,098 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_947f9dd3-414b-442b-9f11-203f344b36a0/bin/uautomizer/witness.graphml [2019-12-07 17:54:37,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:54:37,099 INFO L168 Benchmark]: Toolchain (without parser) took 67393.11 ms. Allocated memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: 5.0 GB). Free memory was 935.4 MB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 17:54:37,099 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:54:37,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:54:37,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.96 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 17:54:37,100 INFO L168 Benchmark]: Boogie Preprocessor took 35.24 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 17:54:37,101 INFO L168 Benchmark]: RCFGBuilder took 440.81 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: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:54:37,101 INFO L168 Benchmark]: TraceAbstraction took 66383.20 ms. Allocated memory was 1.1 GB in the beginning and 6.0 GB in the end (delta: 4.9 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 17:54:37,101 INFO L168 Benchmark]: Witness Printer took 88.55 ms. Allocated memory is still 6.0 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:54:37,103 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 935.4 MB in the beginning and 1.1 GB in the end (delta: -134.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.96 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 35.24 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 440.81 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: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66383.20 ms. Allocated memory was 1.1 GB in the beginning and 6.0 GB in the end (delta: 4.9 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 88.55 ms. Allocated memory is still 6.0 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9487 VarBasedMoverChecksPositive, 322 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 124432 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t23, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L842] FCALL, FORK 0 pthread_create(&t24, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L844] FCALL, FORK 0 pthread_create(&t25, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=7, 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] [L802] 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_p0_EBX=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=7, 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] [L803] 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_p0_EBX=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=7, 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$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)) [L804] 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_p0_EBX=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=7, 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] [L804] 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)) [L805] 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_p0_EBX=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=7, 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$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)) [L806] 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_p0_EBX=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=7, 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] [L806] 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)) [L808] 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_p0_EBX=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=7, 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] [L808] 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)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=7, 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] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=7, 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] [L817] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=7, 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] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=8, 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] [L765] 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=1, __unbuffered_p0_EBX=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=8, 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] [L817] 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) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 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 [L765] 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) [L766] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=8, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 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)) [L767] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=8, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 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)) [L768] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=8, 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))=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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 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)) [L769] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=8, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 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)) [L770] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=8, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 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)) [L771] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=8, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 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)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=8, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=8, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 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) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 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 [L853] 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, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 66.1s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5108 SDtfs, 8197 SDslu, 12367 SDs, 0 SdLazy, 5813 SolverSat, 272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 20 SyntacticMatches, 10 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126470occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 225481 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 781 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 697 ConstructedInterpolants, 0 QuantifiedInterpolants, 176105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...