./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_power.oepc.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_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/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 5264c83fceec8adc5e1adbb35d56a5451f9fd2c6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:24:26,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:24:26,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:24:26,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:24:26,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:24:26,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:24:26,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:24:26,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:24:26,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:24:26,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:24:26,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:24:26,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:24:26,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:24:26,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:24:26,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:24:26,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:24:26,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:24:26,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:24:26,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:24:26,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:24:26,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:24:26,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:24:26,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:24:26,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:24:26,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:24:26,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:24:26,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:24:26,210 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:24:26,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:24:26,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:24:26,211 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:24:26,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:24:26,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:24:26,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:24:26,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:24:26,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:24:26,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:24:26,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:24:26,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:24:26,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:24:26,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:24:26,215 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:24:26,224 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:24:26,224 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:24:26,225 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:24:26,225 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:24:26,225 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:24:26,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:24:26,226 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:24:26,226 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:24:26,226 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:24:26,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:24:26,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:24:26,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:24:26,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:24:26,226 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:24:26,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:24:26,227 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:24:26,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:24:26,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:24:26,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:24:26,227 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:24:26,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:24:26,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:24:26,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:24:26,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:24:26,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:24:26,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:24:26,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:24:26,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:24:26,228 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:24:26,228 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_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/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 -> 5264c83fceec8adc5e1adbb35d56a5451f9fd2c6 [2019-12-07 18:24:26,328 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:24:26,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:24:26,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:24:26,339 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:24:26,339 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:24:26,340 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix000_power.oepc.i [2019-12-07 18:24:26,376 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/data/9167d7c33/240dfb5012cc4306b396cd0b081c9929/FLAGc8105f6a7 [2019-12-07 18:24:26,919 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:24:26,919 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/sv-benchmarks/c/pthread-wmm/mix000_power.oepc.i [2019-12-07 18:24:26,929 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/data/9167d7c33/240dfb5012cc4306b396cd0b081c9929/FLAGc8105f6a7 [2019-12-07 18:24:27,373 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/data/9167d7c33/240dfb5012cc4306b396cd0b081c9929 [2019-12-07 18:24:27,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:24:27,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:24:27,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:24:27,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:24:27,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:24:27,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:24:27" (1/1) ... [2019-12-07 18:24:27,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227d51b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27, skipping insertion in model container [2019-12-07 18:24:27,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:24:27" (1/1) ... [2019-12-07 18:24:27,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:24:27,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:24:27,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:24:27,669 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:24:27,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:24:27,755 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:24:27,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27 WrapperNode [2019-12-07 18:24:27,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:24:27,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:24:27,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:24:27,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:24:27,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27" (1/1) ... [2019-12-07 18:24:27,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27" (1/1) ... [2019-12-07 18:24:27,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:24:27,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:24:27,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:24:27,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:24:27,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27" (1/1) ... [2019-12-07 18:24:27,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27" (1/1) ... [2019-12-07 18:24:27,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27" (1/1) ... [2019-12-07 18:24:27,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27" (1/1) ... [2019-12-07 18:24:27,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27" (1/1) ... [2019-12-07 18:24:27,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27" (1/1) ... [2019-12-07 18:24:27,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27" (1/1) ... [2019-12-07 18:24:27,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:24:27,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:24:27,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:24:27,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:24:27,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:24:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:24:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:24:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:24:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:24:27,864 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:24:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:24:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:24:27,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:24:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:24:27,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:24:27,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:24:27,866 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:24:28,259 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:24:28,259 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:24:28,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:24:28 BoogieIcfgContainer [2019-12-07 18:24:28,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:24:28,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:24:28,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:24:28,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:24:28,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:24:27" (1/3) ... [2019-12-07 18:24:28,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eca008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:24:28, skipping insertion in model container [2019-12-07 18:24:28,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:27" (2/3) ... [2019-12-07 18:24:28,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eca008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:24:28, skipping insertion in model container [2019-12-07 18:24:28,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:24:28" (3/3) ... [2019-12-07 18:24:28,265 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_power.oepc.i [2019-12-07 18:24:28,271 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:24:28,271 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:24:28,276 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:24:28,277 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:24:28,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,319 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:24:28,342 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:24:28,354 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:24:28,354 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:24:28,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:24:28,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:24:28,355 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:24:28,355 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:24:28,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:24:28,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:24:28,365 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-07 18:24:28,366 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 18:24:28,429 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 18:24:28,429 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:24:28,440 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1032 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 18:24:28,463 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 18:24:28,502 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 18:24:28,502 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:24:28,511 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1032 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 18:24:28,537 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-07 18:24:28,538 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:24:31,663 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 18:24:31,936 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 18:24:32,030 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-07 18:24:32,030 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 18:24:32,032 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-07 18:24:33,581 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-07 18:24:33,583 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-07 18:24:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 18:24:33,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:33,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 18:24:33,588 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:33,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:33,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-07 18:24:33,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:33,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649990223] [2019-12-07 18:24:33,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:33,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649990223] [2019-12-07 18:24:33,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:33,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:24:33,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981236001] [2019-12-07 18:24:33,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:33,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:33,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:33,740 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-07 18:24:34,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:34,086 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-07 18:24:34,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:34,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 18:24:34,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:34,234 INFO L225 Difference]: With dead ends: 29506 [2019-12-07 18:24:34,234 INFO L226 Difference]: Without dead ends: 27490 [2019-12-07 18:24:34,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-07 18:24:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-07 18:24:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-07 18:24:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-07 18:24:35,242 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-07 18:24:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:35,242 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-07 18:24:35,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-07 18:24:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:24:35,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:35,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:35,245 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:35,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:35,245 INFO L82 PathProgramCache]: Analyzing trace with hash -271665278, now seen corresponding path program 1 times [2019-12-07 18:24:35,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:35,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950640681] [2019-12-07 18:24:35,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:35,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950640681] [2019-12-07 18:24:35,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:35,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:24:35,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877249200] [2019-12-07 18:24:35,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:35,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:35,307 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 4 states. [2019-12-07 18:24:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:35,699 INFO L93 Difference]: Finished difference Result 43940 states and 147802 transitions. [2019-12-07 18:24:35,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:24:35,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:24:35,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:35,815 INFO L225 Difference]: With dead ends: 43940 [2019-12-07 18:24:35,816 INFO L226 Difference]: Without dead ends: 43933 [2019-12-07 18:24:35,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43933 states. [2019-12-07 18:24:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43933 to 42445. [2019-12-07 18:24:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42445 states. [2019-12-07 18:24:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42445 states to 42445 states and 143845 transitions. [2019-12-07 18:24:36,975 INFO L78 Accepts]: Start accepts. Automaton has 42445 states and 143845 transitions. Word has length 11 [2019-12-07 18:24:36,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:36,976 INFO L462 AbstractCegarLoop]: Abstraction has 42445 states and 143845 transitions. [2019-12-07 18:24:36,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 42445 states and 143845 transitions. [2019-12-07 18:24:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:24:36,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:36,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:36,982 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:36,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:36,982 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-07 18:24:36,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:36,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782125801] [2019-12-07 18:24:36,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:37,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:37,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782125801] [2019-12-07 18:24:37,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:37,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:24:37,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075061115] [2019-12-07 18:24:37,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:37,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:37,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:37,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:37,027 INFO L87 Difference]: Start difference. First operand 42445 states and 143845 transitions. Second operand 4 states. [2019-12-07 18:24:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:37,468 INFO L93 Difference]: Finished difference Result 54065 states and 181150 transitions. [2019-12-07 18:24:37,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:24:37,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:24:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:37,564 INFO L225 Difference]: With dead ends: 54065 [2019-12-07 18:24:37,564 INFO L226 Difference]: Without dead ends: 54065 [2019-12-07 18:24:37,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54065 states. [2019-12-07 18:24:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54065 to 48429. [2019-12-07 18:24:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48429 states. [2019-12-07 18:24:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48429 states to 48429 states and 163514 transitions. [2019-12-07 18:24:38,860 INFO L78 Accepts]: Start accepts. Automaton has 48429 states and 163514 transitions. Word has length 14 [2019-12-07 18:24:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:38,861 INFO L462 AbstractCegarLoop]: Abstraction has 48429 states and 163514 transitions. [2019-12-07 18:24:38,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 48429 states and 163514 transitions. [2019-12-07 18:24:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:24:38,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:38,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:38,864 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:38,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:38,864 INFO L82 PathProgramCache]: Analyzing trace with hash 566526627, now seen corresponding path program 1 times [2019-12-07 18:24:38,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:38,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800950421] [2019-12-07 18:24:38,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:38,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800950421] [2019-12-07 18:24:38,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:38,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:38,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538387424] [2019-12-07 18:24:38,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:38,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:38,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:38,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:38,891 INFO L87 Difference]: Start difference. First operand 48429 states and 163514 transitions. Second operand 3 states. [2019-12-07 18:24:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:39,178 INFO L93 Difference]: Finished difference Result 84362 states and 273188 transitions. [2019-12-07 18:24:39,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:39,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 18:24:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:39,316 INFO L225 Difference]: With dead ends: 84362 [2019-12-07 18:24:39,316 INFO L226 Difference]: Without dead ends: 84362 [2019-12-07 18:24:39,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84362 states. [2019-12-07 18:24:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84362 to 74579. [2019-12-07 18:24:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74579 states. [2019-12-07 18:24:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74579 states to 74579 states and 244551 transitions. [2019-12-07 18:24:41,052 INFO L78 Accepts]: Start accepts. Automaton has 74579 states and 244551 transitions. Word has length 15 [2019-12-07 18:24:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:41,052 INFO L462 AbstractCegarLoop]: Abstraction has 74579 states and 244551 transitions. [2019-12-07 18:24:41,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 74579 states and 244551 transitions. [2019-12-07 18:24:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:24:41,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:41,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:41,057 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:41,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1557518127, now seen corresponding path program 1 times [2019-12-07 18:24:41,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:41,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544785683] [2019-12-07 18:24:41,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:41,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544785683] [2019-12-07 18:24:41,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:41,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:24:41,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982066343] [2019-12-07 18:24:41,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:41,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:41,119 INFO L87 Difference]: Start difference. First operand 74579 states and 244551 transitions. Second operand 3 states. [2019-12-07 18:24:41,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:41,363 INFO L93 Difference]: Finished difference Result 74600 states and 244461 transitions. [2019-12-07 18:24:41,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:41,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:24:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:41,489 INFO L225 Difference]: With dead ends: 74600 [2019-12-07 18:24:41,489 INFO L226 Difference]: Without dead ends: 74600 [2019-12-07 18:24:41,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-07 18:24:43,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74508. [2019-12-07 18:24:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74508 states. [2019-12-07 18:24:43,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74508 states to 74508 states and 244321 transitions. [2019-12-07 18:24:43,179 INFO L78 Accepts]: Start accepts. Automaton has 74508 states and 244321 transitions. Word has length 16 [2019-12-07 18:24:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:43,179 INFO L462 AbstractCegarLoop]: Abstraction has 74508 states and 244321 transitions. [2019-12-07 18:24:43,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 74508 states and 244321 transitions. [2019-12-07 18:24:43,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:24:43,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:43,184 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:43,184 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:43,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:43,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1038427720, now seen corresponding path program 1 times [2019-12-07 18:24:43,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:43,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53527379] [2019-12-07 18:24:43,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:43,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53527379] [2019-12-07 18:24:43,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:43,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:24:43,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318313809] [2019-12-07 18:24:43,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:43,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:43,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:43,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:43,235 INFO L87 Difference]: Start difference. First operand 74508 states and 244321 transitions. Second operand 3 states. [2019-12-07 18:24:43,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:43,478 INFO L93 Difference]: Finished difference Result 74508 states and 240926 transitions. [2019-12-07 18:24:43,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:43,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 18:24:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:43,610 INFO L225 Difference]: With dead ends: 74508 [2019-12-07 18:24:43,610 INFO L226 Difference]: Without dead ends: 74508 [2019-12-07 18:24:43,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74508 states. [2019-12-07 18:24:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74508 to 74308. [2019-12-07 18:24:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74308 states. [2019-12-07 18:24:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74308 states to 74308 states and 240334 transitions. [2019-12-07 18:24:45,215 INFO L78 Accepts]: Start accepts. Automaton has 74308 states and 240334 transitions. Word has length 17 [2019-12-07 18:24:45,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:45,215 INFO L462 AbstractCegarLoop]: Abstraction has 74308 states and 240334 transitions. [2019-12-07 18:24:45,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 74308 states and 240334 transitions. [2019-12-07 18:24:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:24:45,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:45,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:45,219 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:45,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:45,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1509366251, now seen corresponding path program 1 times [2019-12-07 18:24:45,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:45,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807752865] [2019-12-07 18:24:45,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:45,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807752865] [2019-12-07 18:24:45,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:45,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:24:45,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411182639] [2019-12-07 18:24:45,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:45,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:45,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:45,268 INFO L87 Difference]: Start difference. First operand 74308 states and 240334 transitions. Second operand 4 states. [2019-12-07 18:24:45,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:45,484 INFO L93 Difference]: Finished difference Result 69911 states and 225616 transitions. [2019-12-07 18:24:45,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:45,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 18:24:45,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:45,597 INFO L225 Difference]: With dead ends: 69911 [2019-12-07 18:24:45,597 INFO L226 Difference]: Without dead ends: 69911 [2019-12-07 18:24:45,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69911 states. [2019-12-07 18:24:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69911 to 69911. [2019-12-07 18:24:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69911 states. [2019-12-07 18:24:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69911 states to 69911 states and 225616 transitions. [2019-12-07 18:24:47,169 INFO L78 Accepts]: Start accepts. Automaton has 69911 states and 225616 transitions. Word has length 17 [2019-12-07 18:24:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:47,169 INFO L462 AbstractCegarLoop]: Abstraction has 69911 states and 225616 transitions. [2019-12-07 18:24:47,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 69911 states and 225616 transitions. [2019-12-07 18:24:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:24:47,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:47,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:47,173 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:47,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1206588916, now seen corresponding path program 1 times [2019-12-07 18:24:47,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:47,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966756905] [2019-12-07 18:24:47,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:47,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966756905] [2019-12-07 18:24:47,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:47,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:24:47,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378527135] [2019-12-07 18:24:47,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:47,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:47,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:47,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:47,204 INFO L87 Difference]: Start difference. First operand 69911 states and 225616 transitions. Second operand 4 states. [2019-12-07 18:24:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:47,637 INFO L93 Difference]: Finished difference Result 85438 states and 273755 transitions. [2019-12-07 18:24:47,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:24:47,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 18:24:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:47,772 INFO L225 Difference]: With dead ends: 85438 [2019-12-07 18:24:47,772 INFO L226 Difference]: Without dead ends: 85438 [2019-12-07 18:24:47,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85438 states. [2019-12-07 18:24:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85438 to 70560. [2019-12-07 18:24:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70560 states. [2019-12-07 18:24:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70560 states to 70560 states and 227731 transitions. [2019-12-07 18:24:49,640 INFO L78 Accepts]: Start accepts. Automaton has 70560 states and 227731 transitions. Word has length 17 [2019-12-07 18:24:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:49,641 INFO L462 AbstractCegarLoop]: Abstraction has 70560 states and 227731 transitions. [2019-12-07 18:24:49,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 70560 states and 227731 transitions. [2019-12-07 18:24:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:24:49,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:49,648 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] [2019-12-07 18:24:49,648 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:49,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:49,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1669716828, now seen corresponding path program 1 times [2019-12-07 18:24:49,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:49,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449892963] [2019-12-07 18:24:49,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:49,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449892963] [2019-12-07 18:24:49,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:49,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:24:49,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982880188] [2019-12-07 18:24:49,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:49,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:49,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:49,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:49,678 INFO L87 Difference]: Start difference. First operand 70560 states and 227731 transitions. Second operand 3 states. [2019-12-07 18:24:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:49,703 INFO L93 Difference]: Finished difference Result 6495 states and 15036 transitions. [2019-12-07 18:24:49,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:49,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:24:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:49,711 INFO L225 Difference]: With dead ends: 6495 [2019-12-07 18:24:49,711 INFO L226 Difference]: Without dead ends: 6495 [2019-12-07 18:24:49,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6495 states. [2019-12-07 18:24:49,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6495 to 6495. [2019-12-07 18:24:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6495 states. [2019-12-07 18:24:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6495 states to 6495 states and 15036 transitions. [2019-12-07 18:24:49,781 INFO L78 Accepts]: Start accepts. Automaton has 6495 states and 15036 transitions. Word has length 20 [2019-12-07 18:24:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:49,781 INFO L462 AbstractCegarLoop]: Abstraction has 6495 states and 15036 transitions. [2019-12-07 18:24:49,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 6495 states and 15036 transitions. [2019-12-07 18:24:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:24:49,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:49,784 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] [2019-12-07 18:24:49,784 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:49,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:49,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1293061293, now seen corresponding path program 1 times [2019-12-07 18:24:49,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:49,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493993400] [2019-12-07 18:24:49,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:49,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493993400] [2019-12-07 18:24:49,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:49,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:49,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094232631] [2019-12-07 18:24:49,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:24:49,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:49,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:24:49,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:49,817 INFO L87 Difference]: Start difference. First operand 6495 states and 15036 transitions. Second operand 5 states. [2019-12-07 18:24:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:50,093 INFO L93 Difference]: Finished difference Result 8792 states and 19920 transitions. [2019-12-07 18:24:50,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:24:50,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:24:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:50,100 INFO L225 Difference]: With dead ends: 8792 [2019-12-07 18:24:50,100 INFO L226 Difference]: Without dead ends: 8792 [2019-12-07 18:24:50,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:24:50,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2019-12-07 18:24:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 7888. [2019-12-07 18:24:50,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7888 states. [2019-12-07 18:24:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7888 states to 7888 states and 18089 transitions. [2019-12-07 18:24:50,198 INFO L78 Accepts]: Start accepts. Automaton has 7888 states and 18089 transitions. Word has length 27 [2019-12-07 18:24:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:50,198 INFO L462 AbstractCegarLoop]: Abstraction has 7888 states and 18089 transitions. [2019-12-07 18:24:50,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:24:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 7888 states and 18089 transitions. [2019-12-07 18:24:50,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:24:50,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:50,203 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] [2019-12-07 18:24:50,203 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:50,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:50,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1277893089, now seen corresponding path program 1 times [2019-12-07 18:24:50,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:50,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76397024] [2019-12-07 18:24:50,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:50,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76397024] [2019-12-07 18:24:50,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:50,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:50,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375060945] [2019-12-07 18:24:50,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:50,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:50,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:50,231 INFO L87 Difference]: Start difference. First operand 7888 states and 18089 transitions. Second operand 3 states. [2019-12-07 18:24:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:50,283 INFO L93 Difference]: Finished difference Result 8877 states and 19243 transitions. [2019-12-07 18:24:50,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:50,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 18:24:50,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:50,289 INFO L225 Difference]: With dead ends: 8877 [2019-12-07 18:24:50,289 INFO L226 Difference]: Without dead ends: 8877 [2019-12-07 18:24:50,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8877 states. [2019-12-07 18:24:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8877 to 7937. [2019-12-07 18:24:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-12-07 18:24:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 17330 transitions. [2019-12-07 18:24:50,367 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 17330 transitions. Word has length 30 [2019-12-07 18:24:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:50,368 INFO L462 AbstractCegarLoop]: Abstraction has 7937 states and 17330 transitions. [2019-12-07 18:24:50,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 17330 transitions. [2019-12-07 18:24:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:24:50,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:50,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:50,373 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1657093328, now seen corresponding path program 1 times [2019-12-07 18:24:50,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:50,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278375176] [2019-12-07 18:24:50,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:50,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:50,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278375176] [2019-12-07 18:24:50,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:50,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:50,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185025807] [2019-12-07 18:24:50,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:24:50,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:50,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:24:50,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:50,409 INFO L87 Difference]: Start difference. First operand 7937 states and 17330 transitions. Second operand 5 states. [2019-12-07 18:24:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:50,650 INFO L93 Difference]: Finished difference Result 9260 states and 19952 transitions. [2019-12-07 18:24:50,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:24:50,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 18:24:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:50,656 INFO L225 Difference]: With dead ends: 9260 [2019-12-07 18:24:50,656 INFO L226 Difference]: Without dead ends: 9260 [2019-12-07 18:24:50,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:24:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9260 states. [2019-12-07 18:24:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9260 to 7281. [2019-12-07 18:24:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7281 states. [2019-12-07 18:24:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 15997 transitions. [2019-12-07 18:24:50,729 INFO L78 Accepts]: Start accepts. Automaton has 7281 states and 15997 transitions. Word has length 33 [2019-12-07 18:24:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:50,730 INFO L462 AbstractCegarLoop]: Abstraction has 7281 states and 15997 transitions. [2019-12-07 18:24:50,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:24:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 7281 states and 15997 transitions. [2019-12-07 18:24:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:24:50,735 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:50,735 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] [2019-12-07 18:24:50,735 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1233120795, now seen corresponding path program 1 times [2019-12-07 18:24:50,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:50,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364791542] [2019-12-07 18:24:50,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:50,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364791542] [2019-12-07 18:24:50,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:50,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:50,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318349156] [2019-12-07 18:24:50,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:50,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:50,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:50,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:50,769 INFO L87 Difference]: Start difference. First operand 7281 states and 15997 transitions. Second operand 4 states. [2019-12-07 18:24:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:50,789 INFO L93 Difference]: Finished difference Result 5076 states and 11212 transitions. [2019-12-07 18:24:50,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:50,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 18:24:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:50,795 INFO L225 Difference]: With dead ends: 5076 [2019-12-07 18:24:50,795 INFO L226 Difference]: Without dead ends: 5076 [2019-12-07 18:24:50,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5076 states. [2019-12-07 18:24:50,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5076 to 5076. [2019-12-07 18:24:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5076 states. [2019-12-07 18:24:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 11212 transitions. [2019-12-07 18:24:50,845 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 11212 transitions. Word has length 39 [2019-12-07 18:24:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:50,845 INFO L462 AbstractCegarLoop]: Abstraction has 5076 states and 11212 transitions. [2019-12-07 18:24:50,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 11212 transitions. [2019-12-07 18:24:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 18:24:50,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:50,851 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, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:50,851 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:50,851 INFO L82 PathProgramCache]: Analyzing trace with hash 43265710, now seen corresponding path program 1 times [2019-12-07 18:24:50,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:50,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911264909] [2019-12-07 18:24:50,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:50,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911264909] [2019-12-07 18:24:50,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:50,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:50,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922266002] [2019-12-07 18:24:50,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:50,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:50,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:50,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:50,897 INFO L87 Difference]: Start difference. First operand 5076 states and 11212 transitions. Second operand 4 states. [2019-12-07 18:24:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:50,962 INFO L93 Difference]: Finished difference Result 6319 states and 13852 transitions. [2019-12-07 18:24:50,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:50,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 18:24:50,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:50,968 INFO L225 Difference]: With dead ends: 6319 [2019-12-07 18:24:50,968 INFO L226 Difference]: Without dead ends: 6319 [2019-12-07 18:24:50,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6319 states. [2019-12-07 18:24:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6319 to 5453. [2019-12-07 18:24:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2019-12-07 18:24:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 12056 transitions. [2019-12-07 18:24:51,021 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 12056 transitions. Word has length 69 [2019-12-07 18:24:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:51,022 INFO L462 AbstractCegarLoop]: Abstraction has 5453 states and 12056 transitions. [2019-12-07 18:24:51,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 12056 transitions. [2019-12-07 18:24:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 18:24:51,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:51,028 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:51,028 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964716, now seen corresponding path program 1 times [2019-12-07 18:24:51,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:51,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734643858] [2019-12-07 18:24:51,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:51,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734643858] [2019-12-07 18:24:51,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:51,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:24:51,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828685080] [2019-12-07 18:24:51,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:51,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:51,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:51,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:51,089 INFO L87 Difference]: Start difference. First operand 5453 states and 12056 transitions. Second operand 4 states. [2019-12-07 18:24:51,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:51,216 INFO L93 Difference]: Finished difference Result 6362 states and 13878 transitions. [2019-12-07 18:24:51,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:51,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 18:24:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:51,221 INFO L225 Difference]: With dead ends: 6362 [2019-12-07 18:24:51,221 INFO L226 Difference]: Without dead ends: 6362 [2019-12-07 18:24:51,221 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 18:24:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6362 states. [2019-12-07 18:24:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6362 to 6062. [2019-12-07 18:24:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6062 states. [2019-12-07 18:24:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6062 states to 6062 states and 13252 transitions. [2019-12-07 18:24:51,276 INFO L78 Accepts]: Start accepts. Automaton has 6062 states and 13252 transitions. Word has length 70 [2019-12-07 18:24:51,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:51,277 INFO L462 AbstractCegarLoop]: Abstraction has 6062 states and 13252 transitions. [2019-12-07 18:24:51,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 6062 states and 13252 transitions. [2019-12-07 18:24:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 18:24:51,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:51,283 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:51,283 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:51,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1570353220, now seen corresponding path program 2 times [2019-12-07 18:24:51,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:51,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500681567] [2019-12-07 18:24:51,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:51,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500681567] [2019-12-07 18:24:51,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:51,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:24:51,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576431031] [2019-12-07 18:24:51,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:24:51,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:51,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:24:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:51,342 INFO L87 Difference]: Start difference. First operand 6062 states and 13252 transitions. Second operand 5 states. [2019-12-07 18:24:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:51,541 INFO L93 Difference]: Finished difference Result 6628 states and 14358 transitions. [2019-12-07 18:24:51,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:24:51,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-07 18:24:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:51,546 INFO L225 Difference]: With dead ends: 6628 [2019-12-07 18:24:51,546 INFO L226 Difference]: Without dead ends: 6628 [2019-12-07 18:24:51,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:24:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6628 states. [2019-12-07 18:24:51,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6628 to 6179. [2019-12-07 18:24:51,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6179 states. [2019-12-07 18:24:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6179 states to 6179 states and 13447 transitions. [2019-12-07 18:24:51,603 INFO L78 Accepts]: Start accepts. Automaton has 6179 states and 13447 transitions. Word has length 70 [2019-12-07 18:24:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:51,603 INFO L462 AbstractCegarLoop]: Abstraction has 6179 states and 13447 transitions. [2019-12-07 18:24:51,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:24:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 6179 states and 13447 transitions. [2019-12-07 18:24:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 18:24:51,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:51,610 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:51,610 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:51,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:51,610 INFO L82 PathProgramCache]: Analyzing trace with hash -224940730, now seen corresponding path program 3 times [2019-12-07 18:24:51,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:51,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545471205] [2019-12-07 18:24:51,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:51,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545471205] [2019-12-07 18:24:51,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:51,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:51,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846640395] [2019-12-07 18:24:51,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:51,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:51,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:51,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:51,684 INFO L87 Difference]: Start difference. First operand 6179 states and 13447 transitions. Second operand 4 states. [2019-12-07 18:24:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:51,729 INFO L93 Difference]: Finished difference Result 6864 states and 14893 transitions. [2019-12-07 18:24:51,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:24:51,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 18:24:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:51,733 INFO L225 Difference]: With dead ends: 6864 [2019-12-07 18:24:51,734 INFO L226 Difference]: Without dead ends: 4564 [2019-12-07 18:24:51,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4564 states. [2019-12-07 18:24:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4564 to 4053. [2019-12-07 18:24:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4053 states. [2019-12-07 18:24:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 8667 transitions. [2019-12-07 18:24:51,773 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 8667 transitions. Word has length 70 [2019-12-07 18:24:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:51,773 INFO L462 AbstractCegarLoop]: Abstraction has 4053 states and 8667 transitions. [2019-12-07 18:24:51,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 8667 transitions. [2019-12-07 18:24:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 18:24:51,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:51,778 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:51,778 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:51,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:51,778 INFO L82 PathProgramCache]: Analyzing trace with hash -27170738, now seen corresponding path program 4 times [2019-12-07 18:24:51,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:51,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612966106] [2019-12-07 18:24:51,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:51,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612966106] [2019-12-07 18:24:51,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:51,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:24:51,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594070972] [2019-12-07 18:24:51,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:24:51,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:51,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:24:51,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:24:51,864 INFO L87 Difference]: Start difference. First operand 4053 states and 8667 transitions. Second operand 8 states. [2019-12-07 18:24:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:52,179 INFO L93 Difference]: Finished difference Result 7756 states and 16485 transitions. [2019-12-07 18:24:52,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:24:52,180 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-12-07 18:24:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:52,184 INFO L225 Difference]: With dead ends: 7756 [2019-12-07 18:24:52,184 INFO L226 Difference]: Without dead ends: 6966 [2019-12-07 18:24:52,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:24:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2019-12-07 18:24:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 5437. [2019-12-07 18:24:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5437 states. [2019-12-07 18:24:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5437 states to 5437 states and 11759 transitions. [2019-12-07 18:24:52,240 INFO L78 Accepts]: Start accepts. Automaton has 5437 states and 11759 transitions. Word has length 70 [2019-12-07 18:24:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:52,240 INFO L462 AbstractCegarLoop]: Abstraction has 5437 states and 11759 transitions. [2019-12-07 18:24:52,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:24:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5437 states and 11759 transitions. [2019-12-07 18:24:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 18:24:52,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:52,246 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:52,246 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:52,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:52,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1574633916, now seen corresponding path program 5 times [2019-12-07 18:24:52,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:52,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108315692] [2019-12-07 18:24:52,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:52,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108315692] [2019-12-07 18:24:52,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:52,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:24:52,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100369637] [2019-12-07 18:24:52,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:24:52,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:24:52,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:24:52,321 INFO L87 Difference]: Start difference. First operand 5437 states and 11759 transitions. Second operand 7 states. [2019-12-07 18:24:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:52,422 INFO L93 Difference]: Finished difference Result 8927 states and 19215 transitions. [2019-12-07 18:24:52,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:24:52,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-07 18:24:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:52,426 INFO L225 Difference]: With dead ends: 8927 [2019-12-07 18:24:52,426 INFO L226 Difference]: Without dead ends: 6155 [2019-12-07 18:24:52,427 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:24:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6155 states. [2019-12-07 18:24:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6155 to 5433. [2019-12-07 18:24:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5433 states. [2019-12-07 18:24:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5433 states to 5433 states and 11722 transitions. [2019-12-07 18:24:52,474 INFO L78 Accepts]: Start accepts. Automaton has 5433 states and 11722 transitions. Word has length 70 [2019-12-07 18:24:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:52,474 INFO L462 AbstractCegarLoop]: Abstraction has 5433 states and 11722 transitions. [2019-12-07 18:24:52,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:24:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 5433 states and 11722 transitions. [2019-12-07 18:24:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 18:24:52,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:52,479 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:52,480 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:52,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:52,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1426698558, now seen corresponding path program 1 times [2019-12-07 18:24:52,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:52,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731773089] [2019-12-07 18:24:52,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:52,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:52,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731773089] [2019-12-07 18:24:52,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:52,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:24:52,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561410352] [2019-12-07 18:24:52,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:24:52,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:52,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:24:52,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:24:52,537 INFO L87 Difference]: Start difference. First operand 5433 states and 11722 transitions. Second operand 8 states. [2019-12-07 18:24:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:52,757 INFO L93 Difference]: Finished difference Result 8496 states and 18045 transitions. [2019-12-07 18:24:52,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:24:52,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-12-07 18:24:52,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:52,763 INFO L225 Difference]: With dead ends: 8496 [2019-12-07 18:24:52,763 INFO L226 Difference]: Without dead ends: 8013 [2019-12-07 18:24:52,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:24:52,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8013 states. [2019-12-07 18:24:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8013 to 5481. [2019-12-07 18:24:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5481 states. [2019-12-07 18:24:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5481 states to 5481 states and 11812 transitions. [2019-12-07 18:24:52,822 INFO L78 Accepts]: Start accepts. Automaton has 5481 states and 11812 transitions. Word has length 71 [2019-12-07 18:24:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:52,823 INFO L462 AbstractCegarLoop]: Abstraction has 5481 states and 11812 transitions. [2019-12-07 18:24:52,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:24:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5481 states and 11812 transitions. [2019-12-07 18:24:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 18:24:52,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:52,827 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1762924738, now seen corresponding path program 2 times [2019-12-07 18:24:52,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:52,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803016360] [2019-12-07 18:24:52,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:24:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:24:52,903 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:24:52,903 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:24:52,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~__unbuffered_p1_EBX~0_103) (= v_~y$r_buff1_thd0~0_223 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_19 0) (= v_~y$w_buff0_used~0_997 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EAX~0_104 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~y$r_buff1_thd2~0_319) (= v_~y$r_buff0_thd0~0_188 0) (= v_~main$tmp_guard1~0_72 0) (= v_~y$r_buff1_thd1~0_376 0) (= v_~y$w_buff1~0_221 0) (< 0 |v_#StackHeapBarrier_15|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t0~0.base_51|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_51|) |v_ULTIMATE.start_main_~#t0~0.offset_32| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t0~0.base_51| 4)) (= v_~y~0_343 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_597 0) (= v_~y$w_buff1_used~0_499 0) (= 0 v_~__unbuffered_cnt~0_73) (= v_~__unbuffered_p0_EBX~0_80 0) (= 0 v_~y$r_buff0_thd2~0_403) (= |v_ULTIMATE.start_main_~#t0~0.offset_32| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t0~0.base_51|)) (= 0 v_~__unbuffered_p0_EAX~0_104) (= v_~y$flush_delayed~0_191 0) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t0~0.base_51| 1)) (= v_~weak$$choice2~0_254 0) (= v_~x~0_54 0) (= v_~y$mem_tmp~0_169 0) (= 0 v_~weak$$choice0~0_159) (= 0 v_~y$w_buff0~0_236))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~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_997, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_143|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_~#t0~0.offset=|v_ULTIMATE.start_main_~#t0~0.offset_32|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_376, ~y$mem_tmp~0=v_~y$mem_tmp~0_169, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_236, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_597, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_17|, ~y~0=v_~y~0_343, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_103, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ULTIMATE.start_main_~#t0~0.base=|v_ULTIMATE.start_main_~#t0~0.base_51|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_319, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, #valid=|v_#valid_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_403, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_254, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_18|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_223, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_499} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_~#t0~0.offset, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t0~0.base, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t1~0.base, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:24:52,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1~0.offset_10| 0) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1~0.base_11|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1~0.base_11|) |v_ULTIMATE.start_main_~#t1~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t1~0.base_11| 0)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_10|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1~0.offset, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 18:24:52,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~y$r_buff0_thd1~0_In-1599885613 ~y$r_buff1_thd1~0_Out-1599885613) (= ~y$r_buff1_thd2~0_Out-1599885613 ~y$r_buff0_thd2~0_In-1599885613) (= |P0Thread1of1ForFork1_#t~nondet3_In-1599885613| ~weak$$choice0~0_Out-1599885613) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1599885613 0)) (= ~weak$$choice2~0_Out-1599885613 ~y$flush_delayed~0_Out-1599885613) (= ~weak$$choice2~0_Out-1599885613 |P0Thread1of1ForFork1_#t~nondet4_In-1599885613|) (= ~y$r_buff1_thd0~0_Out-1599885613 ~y$r_buff0_thd0~0_In-1599885613) (= ~y$r_buff0_thd1~0_Out-1599885613 1) (= ~y~0_In-1599885613 ~y$mem_tmp~0_Out-1599885613)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1599885613, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1599885613, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1599885613, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1599885613, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-1599885613|, ~y~0=~y~0_In-1599885613, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-1599885613|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1599885613, ~weak$$choice0~0=~weak$$choice0~0_Out-1599885613, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1599885613, ~y$mem_tmp~0=~y$mem_tmp~0_Out-1599885613, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1599885613, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1599885613, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1599885613, ~y$flush_delayed~0=~y$flush_delayed~0_Out-1599885613, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1599885613, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-1599885613|, ~y~0=~y~0_In-1599885613, ~weak$$choice2~0=~weak$$choice2~0_Out-1599885613, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-1599885613|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1599885613} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:24:52,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork1_#t~ite5_Out-1208486420| |P0Thread1of1ForFork1_#t~ite6_Out-1208486420|)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1208486420 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1208486420 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1208486420| ~y$w_buff0~0_In-1208486420) .cse1 (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1208486420| ~y$w_buff1~0_In-1208486420)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1208486420, ~y$w_buff1~0=~y$w_buff1~0_In-1208486420, ~y$w_buff0~0=~y$w_buff0~0_In-1208486420, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1208486420} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1208486420|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1208486420, ~y$w_buff1~0=~y$w_buff1~0_In-1208486420, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1208486420|, ~y$w_buff0~0=~y$w_buff0~0_In-1208486420, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1208486420} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 18:24:52,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~y$r_buff0_thd1~0_87 v_~y$r_buff0_thd1~0_86)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:24:52,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2005367451 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out-2005367451| ~y$mem_tmp~0_In-2005367451)) (and (= |P0Thread1of1ForFork1_#t~ite25_Out-2005367451| ~y~0_In-2005367451) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2005367451, ~y$flush_delayed~0=~y$flush_delayed~0_In-2005367451, ~y~0=~y~0_In-2005367451} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2005367451, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-2005367451|, ~y$flush_delayed~0=~y$flush_delayed~0_In-2005367451, ~y~0=~y~0_In-2005367451} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:24:52,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1503961838 256)))) (or (and (= ~y~0_In-1503961838 |P1Thread1of1ForFork0_#t~ite54_Out-1503961838|) .cse0) (and (not .cse0) (= ~y$mem_tmp~0_In-1503961838 |P1Thread1of1ForFork0_#t~ite54_Out-1503961838|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1503961838, ~y$flush_delayed~0=~y$flush_delayed~0_In-1503961838, ~y~0=~y~0_In-1503961838} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1503961838, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-1503961838|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1503961838, ~y~0=~y~0_In-1503961838} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:24:52,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-484103050 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-484103050 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out-484103050|)) (and (= ~y$w_buff0_used~0_In-484103050 |P0Thread1of1ForFork1_#t~ite28_Out-484103050|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-484103050, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-484103050} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-484103050, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-484103050|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-484103050} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:24:52,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-26599546 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-26599546 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-26599546 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-26599546 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-26599546 |P0Thread1of1ForFork1_#t~ite29_Out-26599546|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-26599546|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-26599546, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-26599546, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-26599546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-26599546} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-26599546, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-26599546, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-26599546|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-26599546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-26599546} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 18:24:52,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In350261276 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In350261276 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out350261276 ~y$r_buff0_thd1~0_In350261276))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out350261276)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In350261276, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In350261276} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In350261276, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out350261276, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out350261276|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:24:52,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1620338439 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1620338439 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1620338439 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1620338439 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out1620338439|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In1620338439 |P0Thread1of1ForFork1_#t~ite31_Out1620338439|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1620338439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1620338439, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1620338439, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1620338439} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1620338439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1620338439, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1620338439, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out1620338439|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1620338439} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:24:52,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:24:52,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-94112587 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-94112587 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-94112587 |P1Thread1of1ForFork0_#t~ite55_Out-94112587|)) (and (= ~y$w_buff1~0_In-94112587 |P1Thread1of1ForFork0_#t~ite55_Out-94112587|) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-94112587, ~y$w_buff1~0=~y$w_buff1~0_In-94112587, ~y~0=~y~0_In-94112587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-94112587} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-94112587, ~y$w_buff1~0=~y$w_buff1~0_In-94112587, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-94112587|, ~y~0=~y~0_In-94112587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-94112587} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 18:24:52,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_76 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-07 18:24:52,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-669048726 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-669048726 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out-669048726| 0)) (and (= |P1Thread1of1ForFork0_#t~ite57_Out-669048726| ~y$w_buff0_used~0_In-669048726) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-669048726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-669048726} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-669048726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-669048726, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-669048726|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 18:24:52,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1539839021 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1539839021 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1539839021 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1539839021 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1539839021 |P1Thread1of1ForFork0_#t~ite58_Out-1539839021|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite58_Out-1539839021|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1539839021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1539839021, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1539839021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1539839021} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1539839021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1539839021, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1539839021, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out-1539839021|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1539839021} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 18:24:52,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1700127116 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1700127116 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite59_Out-1700127116|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite59_Out-1700127116| ~y$r_buff0_thd2~0_In-1700127116) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700127116, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1700127116} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700127116, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1700127116, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1700127116|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 18:24:52,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-639028076 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-639028076 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-639028076 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-639028076 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite60_Out-639028076| 0)) (and (= |P1Thread1of1ForFork0_#t~ite60_Out-639028076| ~y$r_buff1_thd2~0_In-639028076) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-639028076, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-639028076, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-639028076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639028076} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-639028076, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-639028076, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-639028076|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-639028076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639028076} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 18:24:52,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~y$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_192, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 18:24:52,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:24:52,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In186937072 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In186937072 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite63_Out186937072| |ULTIMATE.start_main_#t~ite64_Out186937072|))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out186937072| ~y$w_buff1~0_In186937072) (not .cse0) (not .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite63_Out186937072| ~y~0_In186937072) (or .cse0 .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In186937072, ~y~0=~y~0_In186937072, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In186937072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In186937072} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out186937072|, ~y$w_buff1~0=~y$w_buff1~0_In186937072, ~y~0=~y~0_In186937072, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In186937072, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out186937072|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In186937072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:24:52,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1231118577 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1231118577 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite65_Out1231118577| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1231118577 |ULTIMATE.start_main_#t~ite65_Out1231118577|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1231118577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1231118577} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1231118577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1231118577, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1231118577|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 18:24:52,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1742219168 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1742219168 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1742219168 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1742219168 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out1742219168| ~y$w_buff1_used~0_In1742219168)) (and (= |ULTIMATE.start_main_#t~ite66_Out1742219168| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1742219168, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1742219168, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1742219168, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1742219168} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1742219168, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1742219168, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1742219168|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1742219168, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1742219168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 18:24:52,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-890607910 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-890607910 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-890607910 |ULTIMATE.start_main_#t~ite67_Out-890607910|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out-890607910|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-890607910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-890607910} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-890607910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-890607910, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-890607910|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 18:24:52,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1065961402 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1065961402 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1065961402 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1065961402 256)))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out1065961402| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite68_Out1065961402| ~y$r_buff1_thd0~0_In1065961402) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1065961402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1065961402, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1065961402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1065961402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1065961402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1065961402, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1065961402|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1065961402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1065961402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 18:24:52,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_40 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_~__unbuffered_p0_EBX~0_46 0) (= 1 v_~__unbuffered_p1_EAX~0_72) (= v_~__unbuffered_p1_EBX~0_61 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_82|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_81|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:24:52,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:24:52 BasicIcfg [2019-12-07 18:24:52,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:24:52,981 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:24:52,981 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:24:52,981 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:24:52,982 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:24:28" (3/4) ... [2019-12-07 18:24:52,983 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:24:52,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= 0 v_~__unbuffered_p1_EBX~0_103) (= v_~y$r_buff1_thd0~0_223 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_19 0) (= v_~y$w_buff0_used~0_997 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EAX~0_104 0) (= v_~y$read_delayed~0_4 0) (= 0 v_~y$r_buff1_thd2~0_319) (= v_~y$r_buff0_thd0~0_188 0) (= v_~main$tmp_guard1~0_72 0) (= v_~y$r_buff1_thd1~0_376 0) (= v_~y$w_buff1~0_221 0) (< 0 |v_#StackHeapBarrier_15|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t0~0.base_51|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_51|) |v_ULTIMATE.start_main_~#t0~0.offset_32| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t0~0.base_51| 4)) (= v_~y~0_343 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_597 0) (= v_~y$w_buff1_used~0_499 0) (= 0 v_~__unbuffered_cnt~0_73) (= v_~__unbuffered_p0_EBX~0_80 0) (= 0 v_~y$r_buff0_thd2~0_403) (= |v_ULTIMATE.start_main_~#t0~0.offset_32| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t0~0.base_51|)) (= 0 v_~__unbuffered_p0_EAX~0_104) (= v_~y$flush_delayed~0_191 0) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t0~0.base_51| 1)) (= v_~weak$$choice2~0_254 0) (= v_~x~0_54 0) (= v_~y$mem_tmp~0_169 0) (= 0 v_~weak$$choice0~0_159) (= 0 v_~y$w_buff0~0_236))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~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_997, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_143|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_72, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_~#t0~0.offset=|v_ULTIMATE.start_main_~#t0~0.offset_32|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_376, ~y$mem_tmp~0=v_~y$mem_tmp~0_169, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_104, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_104, ~y$w_buff0~0=v_~y$w_buff0~0_236, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_597, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_17|, ~y~0=v_~y~0_343, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_103, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ULTIMATE.start_main_~#t0~0.base=|v_ULTIMATE.start_main_~#t0~0.base_51|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_319, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_221, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_188, #valid=|v_#valid_74|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_403, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_254, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_18|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_223, ~x~0=v_~x~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_499} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_~#t0~0.offset, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t0~0.base, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t1~0.base, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1~0.offset, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:24:52,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1~0.offset_10| 0) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1~0.base_11|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1~0.base_11|) |v_ULTIMATE.start_main_~#t1~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t1~0.base_11| 0)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_10|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1~0.offset, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 18:24:52,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~y$r_buff0_thd1~0_In-1599885613 ~y$r_buff1_thd1~0_Out-1599885613) (= ~y$r_buff1_thd2~0_Out-1599885613 ~y$r_buff0_thd2~0_In-1599885613) (= |P0Thread1of1ForFork1_#t~nondet3_In-1599885613| ~weak$$choice0~0_Out-1599885613) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1599885613 0)) (= ~weak$$choice2~0_Out-1599885613 ~y$flush_delayed~0_Out-1599885613) (= ~weak$$choice2~0_Out-1599885613 |P0Thread1of1ForFork1_#t~nondet4_In-1599885613|) (= ~y$r_buff1_thd0~0_Out-1599885613 ~y$r_buff0_thd0~0_In-1599885613) (= ~y$r_buff0_thd1~0_Out-1599885613 1) (= ~y~0_In-1599885613 ~y$mem_tmp~0_Out-1599885613)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1599885613, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1599885613, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1599885613, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1599885613, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-1599885613|, ~y~0=~y~0_In-1599885613, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-1599885613|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1599885613, ~weak$$choice0~0=~weak$$choice0~0_Out-1599885613, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1599885613, ~y$mem_tmp~0=~y$mem_tmp~0_Out-1599885613, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1599885613, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1599885613, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1599885613, ~y$flush_delayed~0=~y$flush_delayed~0_Out-1599885613, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1599885613, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-1599885613|, ~y~0=~y~0_In-1599885613, ~weak$$choice2~0=~weak$$choice2~0_Out-1599885613, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-1599885613|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1599885613} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:24:52,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork1_#t~ite5_Out-1208486420| |P0Thread1of1ForFork1_#t~ite6_Out-1208486420|)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1208486420 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1208486420 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1208486420| ~y$w_buff0~0_In-1208486420) .cse1 (not .cse2)) (and .cse1 (or .cse2 .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1208486420| ~y$w_buff1~0_In-1208486420)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1208486420, ~y$w_buff1~0=~y$w_buff1~0_In-1208486420, ~y$w_buff0~0=~y$w_buff0~0_In-1208486420, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1208486420} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1208486420|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1208486420, ~y$w_buff1~0=~y$w_buff1~0_In-1208486420, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1208486420|, ~y$w_buff0~0=~y$w_buff0~0_In-1208486420, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1208486420} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 18:24:52,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~y$r_buff0_thd1~0_87 v_~y$r_buff0_thd1~0_86)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:24:52,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2005367451 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out-2005367451| ~y$mem_tmp~0_In-2005367451)) (and (= |P0Thread1of1ForFork1_#t~ite25_Out-2005367451| ~y~0_In-2005367451) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2005367451, ~y$flush_delayed~0=~y$flush_delayed~0_In-2005367451, ~y~0=~y~0_In-2005367451} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2005367451, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-2005367451|, ~y$flush_delayed~0=~y$flush_delayed~0_In-2005367451, ~y~0=~y~0_In-2005367451} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:24:52,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1503961838 256)))) (or (and (= ~y~0_In-1503961838 |P1Thread1of1ForFork0_#t~ite54_Out-1503961838|) .cse0) (and (not .cse0) (= ~y$mem_tmp~0_In-1503961838 |P1Thread1of1ForFork0_#t~ite54_Out-1503961838|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1503961838, ~y$flush_delayed~0=~y$flush_delayed~0_In-1503961838, ~y~0=~y~0_In-1503961838} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1503961838, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-1503961838|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1503961838, ~y~0=~y~0_In-1503961838} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 18:24:52,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-484103050 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-484103050 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out-484103050|)) (and (= ~y$w_buff0_used~0_In-484103050 |P0Thread1of1ForFork1_#t~ite28_Out-484103050|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-484103050, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-484103050} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-484103050, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-484103050|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-484103050} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:24:52,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-26599546 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-26599546 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-26599546 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-26599546 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-26599546 |P0Thread1of1ForFork1_#t~ite29_Out-26599546|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-26599546|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-26599546, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-26599546, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-26599546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-26599546} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-26599546, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-26599546, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-26599546|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-26599546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-26599546} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 18:24:52,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In350261276 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In350261276 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out350261276 ~y$r_buff0_thd1~0_In350261276))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out350261276)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In350261276, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In350261276} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In350261276, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out350261276, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out350261276|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 18:24:52,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1620338439 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1620338439 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1620338439 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1620338439 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out1620338439|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In1620338439 |P0Thread1of1ForFork1_#t~ite31_Out1620338439|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1620338439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1620338439, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1620338439, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1620338439} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1620338439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1620338439, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1620338439, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out1620338439|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1620338439} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:24:52,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:24:52,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-94112587 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-94112587 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-94112587 |P1Thread1of1ForFork0_#t~ite55_Out-94112587|)) (and (= ~y$w_buff1~0_In-94112587 |P1Thread1of1ForFork0_#t~ite55_Out-94112587|) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-94112587, ~y$w_buff1~0=~y$w_buff1~0_In-94112587, ~y~0=~y~0_In-94112587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-94112587} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-94112587, ~y$w_buff1~0=~y$w_buff1~0_In-94112587, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-94112587|, ~y~0=~y~0_In-94112587, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-94112587} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 18:24:52,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_76 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~y~0=v_~y~0_76} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-07 18:24:52,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-669048726 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-669048726 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out-669048726| 0)) (and (= |P1Thread1of1ForFork0_#t~ite57_Out-669048726| ~y$w_buff0_used~0_In-669048726) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-669048726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-669048726} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-669048726, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-669048726, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-669048726|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 18:24:52,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1539839021 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1539839021 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1539839021 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1539839021 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1539839021 |P1Thread1of1ForFork0_#t~ite58_Out-1539839021|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite58_Out-1539839021|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1539839021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1539839021, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1539839021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1539839021} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1539839021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1539839021, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1539839021, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out-1539839021|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1539839021} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 18:24:52,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1700127116 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1700127116 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite59_Out-1700127116|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite59_Out-1700127116| ~y$r_buff0_thd2~0_In-1700127116) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700127116, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1700127116} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1700127116, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1700127116, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1700127116|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 18:24:52,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-639028076 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-639028076 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-639028076 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-639028076 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite60_Out-639028076| 0)) (and (= |P1Thread1of1ForFork0_#t~ite60_Out-639028076| ~y$r_buff1_thd2~0_In-639028076) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-639028076, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-639028076, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-639028076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639028076} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-639028076, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-639028076, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-639028076|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-639028076, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-639028076} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 18:24:52,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~y$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_192, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 18:24:52,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:24:52,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In186937072 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In186937072 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite63_Out186937072| |ULTIMATE.start_main_#t~ite64_Out186937072|))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out186937072| ~y$w_buff1~0_In186937072) (not .cse0) (not .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite63_Out186937072| ~y~0_In186937072) (or .cse0 .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In186937072, ~y~0=~y~0_In186937072, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In186937072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In186937072} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out186937072|, ~y$w_buff1~0=~y$w_buff1~0_In186937072, ~y~0=~y~0_In186937072, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In186937072, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out186937072|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In186937072} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:24:52,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1231118577 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1231118577 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite65_Out1231118577| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1231118577 |ULTIMATE.start_main_#t~ite65_Out1231118577|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1231118577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1231118577} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1231118577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1231118577, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1231118577|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 18:24:52,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1742219168 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1742219168 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1742219168 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1742219168 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out1742219168| ~y$w_buff1_used~0_In1742219168)) (and (= |ULTIMATE.start_main_#t~ite66_Out1742219168| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1742219168, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1742219168, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1742219168, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1742219168} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1742219168, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1742219168, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1742219168|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1742219168, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1742219168} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 18:24:52,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-890607910 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-890607910 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-890607910 |ULTIMATE.start_main_#t~ite67_Out-890607910|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite67_Out-890607910|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-890607910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-890607910} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-890607910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-890607910, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-890607910|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 18:24:52,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1065961402 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1065961402 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1065961402 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1065961402 256)))) (or (and (= |ULTIMATE.start_main_#t~ite68_Out1065961402| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite68_Out1065961402| ~y$r_buff1_thd0~0_In1065961402) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1065961402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1065961402, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1065961402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1065961402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1065961402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1065961402, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1065961402|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1065961402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1065961402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 18:24:52,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1060] [1060] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_40 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_~__unbuffered_p0_EBX~0_46 0) (= 1 v_~__unbuffered_p1_EAX~0_72) (= v_~__unbuffered_p1_EBX~0_61 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_82|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_46, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_61, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_81|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:24:53,054 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a6f8bf95-e114-44d7-8a3e-ca051cc5572c/bin/uautomizer/witness.graphml [2019-12-07 18:24:53,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:24:53,055 INFO L168 Benchmark]: Toolchain (without parser) took 25678.86 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.5 GB). Free memory was 938.0 MB in the beginning and 806.9 MB in the end (delta: 131.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-12-07 18:24:53,055 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:24:53,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.0 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -98.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:24:53,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:24:53,056 INFO L168 Benchmark]: Boogie Preprocessor took 27.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:24:53,056 INFO L168 Benchmark]: RCFGBuilder took 437.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 970.5 MB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:24:53,057 INFO L168 Benchmark]: TraceAbstraction took 24719.98 ms. Allocated memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 970.5 MB in the beginning and 821.5 MB in the end (delta: 149.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-12-07 18:24:53,057 INFO L168 Benchmark]: Witness Printer took 73.07 ms. Allocated memory is still 3.5 GB. Free memory was 821.5 MB in the beginning and 806.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:24:53,058 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.0 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -98.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 437.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 970.5 MB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24719.98 ms. Allocated memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 970.5 MB in the beginning and 821.5 MB in the end (delta: 149.1 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 73.07 ms. Allocated memory is still 3.5 GB. Free memory was 821.5 MB in the beginning and 806.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9684 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t0, ((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, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L820] FCALL, FORK 0 pthread_create(&t1, ((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, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L783] 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, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L783] 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) [L784] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L784] 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)) [L785] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L785] 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)) [L786] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L786] 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)) [L787] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L787] 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)) [L788] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L788] 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)) [L789] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L789] 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)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L795] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L826] 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) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 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 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4503 SDtfs, 3788 SDslu, 8690 SDs, 0 SdLazy, 2574 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74579occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 42809 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 820 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 176627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...