./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_pso.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_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/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 f77548cd3bb8303f92b35953363c377580d39e98 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:10:10,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:10:10,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:10:10,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:10:10,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:10:10,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:10:10,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:10:10,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:10:10,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:10:10,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:10:10,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:10:10,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:10:10,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:10:10,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:10:10,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:10:10,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:10:10,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:10:10,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:10:10,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:10:10,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:10:10,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:10:10,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:10:10,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:10:10,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:10:10,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:10:10,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:10:10,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:10:10,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:10:10,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:10:10,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:10:10,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:10:10,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:10:10,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:10:10,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:10:10,449 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:10:10,449 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:10:10,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:10:10,450 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:10:10,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:10:10,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:10:10,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:10:10,451 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:10:10,461 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:10:10,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:10:10,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:10:10,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:10:10,462 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:10:10,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:10:10,462 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:10:10,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:10:10,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:10:10,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:10:10,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:10:10,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:10:10,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:10:10,463 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:10:10,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:10:10,463 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:10:10,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:10:10,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:10:10,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:10:10,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:10:10,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:10:10,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:10:10,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:10:10,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:10:10,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:10:10,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:10:10,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:10:10,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:10:10,465 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:10:10,465 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_a868cd7a-10bd-4873-8b3e-359d786b5cec/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 -> f77548cd3bb8303f92b35953363c377580d39e98 [2019-12-07 17:10:10,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:10:10,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:10:10,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:10:10,579 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:10:10,579 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:10:10,579 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi008_pso.oepc.i [2019-12-07 17:10:10,618 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/data/f8056f833/6fdd03099a2d412ca622206dbfd26680/FLAG3dca63fa9 [2019-12-07 17:10:11,089 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:10:11,090 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/sv-benchmarks/c/pthread-wmm/rfi008_pso.oepc.i [2019-12-07 17:10:11,100 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/data/f8056f833/6fdd03099a2d412ca622206dbfd26680/FLAG3dca63fa9 [2019-12-07 17:10:11,110 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/data/f8056f833/6fdd03099a2d412ca622206dbfd26680 [2019-12-07 17:10:11,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:10:11,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:10:11,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:11,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:10:11,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:10:11,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:11" (1/1) ... [2019-12-07 17:10:11,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68daf569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11, skipping insertion in model container [2019-12-07 17:10:11,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:11" (1/1) ... [2019-12-07 17:10:11,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:10:11,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:10:11,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:11,410 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:10:11,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:11,503 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:10:11,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11 WrapperNode [2019-12-07 17:10:11,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:11,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:10:11,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:10:11,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:10:11,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11" (1/1) ... [2019-12-07 17:10:11,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11" (1/1) ... [2019-12-07 17:10:11,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:10:11,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:10:11,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:10:11,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:10:11,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11" (1/1) ... [2019-12-07 17:10:11,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11" (1/1) ... [2019-12-07 17:10:11,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11" (1/1) ... [2019-12-07 17:10:11,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11" (1/1) ... [2019-12-07 17:10:11,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11" (1/1) ... [2019-12-07 17:10:11,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11" (1/1) ... [2019-12-07 17:10:11,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11" (1/1) ... [2019-12-07 17:10:11,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:10:11,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:10:11,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:10:11,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:10:11,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:10:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:10:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:10:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:10:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:10:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:10:11,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:10:11,618 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:10:11,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:10:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:10:11,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:10:11,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:10:11,620 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:10:12,021 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:10:12,021 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:10:12,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:12 BoogieIcfgContainer [2019-12-07 17:10:12,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:10:12,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:10:12,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:10:12,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:10:12,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:10:11" (1/3) ... [2019-12-07 17:10:12,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75633f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:10:12, skipping insertion in model container [2019-12-07 17:10:12,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:11" (2/3) ... [2019-12-07 17:10:12,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75633f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:10:12, skipping insertion in model container [2019-12-07 17:10:12,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:12" (3/3) ... [2019-12-07 17:10:12,028 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_pso.oepc.i [2019-12-07 17:10:12,034 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:10:12,034 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:10:12,039 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:10:12,040 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:10:12,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,069 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,091 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,091 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,093 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,094 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,095 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,096 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:10:12,116 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:10:12,128 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:10:12,128 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:10:12,128 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:10:12,129 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:10:12,129 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:10:12,129 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:10:12,129 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:10:12,129 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:10:12,139 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-07 17:10:12,140 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 17:10:12,202 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 17:10:12,202 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:10:12,216 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 1046 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 17:10:12,239 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 17:10:12,275 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 17:10:12,275 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:10:12,284 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 1046 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 17:10:12,309 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-07 17:10:12,310 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:10:15,541 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 17:10:15,719 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 17:10:15,813 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-07 17:10:15,813 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 17:10:15,816 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-07 17:10:17,385 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-07 17:10:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-07 17:10:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:10:17,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:17,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:10:17,391 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:17,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-07 17:10:17,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:17,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418725407] [2019-12-07 17:10:17,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:17,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418725407] [2019-12-07 17:10:17,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:17,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:10:17,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37592688] [2019-12-07 17:10:17,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:17,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:17,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:17,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:17,541 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-07 17:10:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:17,837 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-07 17:10:17,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:17,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:10:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:17,987 INFO L225 Difference]: With dead ends: 29506 [2019-12-07 17:10:17,987 INFO L226 Difference]: Without dead ends: 27490 [2019-12-07 17:10:17,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-07 17:10:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-07 17:10:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-07 17:10:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-07 17:10:19,066 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-07 17:10:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:19,067 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-07 17:10:19,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-07 17:10:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:10:19,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:19,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:19,070 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:19,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash -272589760, now seen corresponding path program 1 times [2019-12-07 17:10:19,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:19,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316969093] [2019-12-07 17:10:19,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:19,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316969093] [2019-12-07 17:10:19,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:19,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:19,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174764387] [2019-12-07 17:10:19,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:19,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:19,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:19,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:19,131 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 4 states. [2019-12-07 17:10:19,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:19,479 INFO L93 Difference]: Finished difference Result 43940 states and 147802 transitions. [2019-12-07 17:10:19,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:19,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:10:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:19,599 INFO L225 Difference]: With dead ends: 43940 [2019-12-07 17:10:19,599 INFO L226 Difference]: Without dead ends: 43933 [2019-12-07 17:10:19,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43933 states. [2019-12-07 17:10:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43933 to 42445. [2019-12-07 17:10:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42445 states. [2019-12-07 17:10:20,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42445 states to 42445 states and 143845 transitions. [2019-12-07 17:10:20,791 INFO L78 Accepts]: Start accepts. Automaton has 42445 states and 143845 transitions. Word has length 11 [2019-12-07 17:10:20,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:20,791 INFO L462 AbstractCegarLoop]: Abstraction has 42445 states and 143845 transitions. [2019-12-07 17:10:20,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 42445 states and 143845 transitions. [2019-12-07 17:10:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:10:20,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:20,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:20,798 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:20,799 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-07 17:10:20,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:20,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14856230] [2019-12-07 17:10:20,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:20,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14856230] [2019-12-07 17:10:20,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:20,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:20,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040996507] [2019-12-07 17:10:20,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:20,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:20,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:20,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:20,854 INFO L87 Difference]: Start difference. First operand 42445 states and 143845 transitions. Second operand 4 states. [2019-12-07 17:10:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:21,158 INFO L93 Difference]: Finished difference Result 54065 states and 181150 transitions. [2019-12-07 17:10:21,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:21,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:10:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:21,254 INFO L225 Difference]: With dead ends: 54065 [2019-12-07 17:10:21,254 INFO L226 Difference]: Without dead ends: 54065 [2019-12-07 17:10:21,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54065 states. [2019-12-07 17:10:22,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54065 to 48429. [2019-12-07 17:10:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48429 states. [2019-12-07 17:10:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48429 states to 48429 states and 163514 transitions. [2019-12-07 17:10:22,427 INFO L78 Accepts]: Start accepts. Automaton has 48429 states and 163514 transitions. Word has length 14 [2019-12-07 17:10:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:22,428 INFO L462 AbstractCegarLoop]: Abstraction has 48429 states and 163514 transitions. [2019-12-07 17:10:22,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:22,428 INFO L276 IsEmpty]: Start isEmpty. Operand 48429 states and 163514 transitions. [2019-12-07 17:10:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:10:22,430 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:22,430 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:22,430 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:22,431 INFO L82 PathProgramCache]: Analyzing trace with hash 566526596, now seen corresponding path program 1 times [2019-12-07 17:10:22,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:22,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269052319] [2019-12-07 17:10:22,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:22,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269052319] [2019-12-07 17:10:22,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:22,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:22,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148817767] [2019-12-07 17:10:22,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:22,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:22,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:22,455 INFO L87 Difference]: Start difference. First operand 48429 states and 163514 transitions. Second operand 3 states. [2019-12-07 17:10:22,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:22,727 INFO L93 Difference]: Finished difference Result 84362 states and 273188 transitions. [2019-12-07 17:10:22,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:22,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 17:10:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:22,982 INFO L225 Difference]: With dead ends: 84362 [2019-12-07 17:10:22,982 INFO L226 Difference]: Without dead ends: 84362 [2019-12-07 17:10:22,982 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 17:10:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84362 states. [2019-12-07 17:10:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84362 to 74579. [2019-12-07 17:10:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74579 states. [2019-12-07 17:10:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74579 states to 74579 states and 244551 transitions. [2019-12-07 17:10:24,711 INFO L78 Accepts]: Start accepts. Automaton has 74579 states and 244551 transitions. Word has length 15 [2019-12-07 17:10:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:24,711 INFO L462 AbstractCegarLoop]: Abstraction has 74579 states and 244551 transitions. [2019-12-07 17:10:24,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 74579 states and 244551 transitions. [2019-12-07 17:10:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:10:24,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:24,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:24,715 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:24,716 INFO L82 PathProgramCache]: Analyzing trace with hash 965979864, now seen corresponding path program 1 times [2019-12-07 17:10:24,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:24,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694033233] [2019-12-07 17:10:24,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:24,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694033233] [2019-12-07 17:10:24,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:24,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:24,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640841917] [2019-12-07 17:10:24,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:24,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:24,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:24,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:24,764 INFO L87 Difference]: Start difference. First operand 74579 states and 244551 transitions. Second operand 3 states. [2019-12-07 17:10:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:24,977 INFO L93 Difference]: Finished difference Result 74579 states and 241156 transitions. [2019-12-07 17:10:24,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:24,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:10:24,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:25,100 INFO L225 Difference]: With dead ends: 74579 [2019-12-07 17:10:25,100 INFO L226 Difference]: Without dead ends: 74579 [2019-12-07 17:10:25,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74579 states. [2019-12-07 17:10:26,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74579 to 74379. [2019-12-07 17:10:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74379 states. [2019-12-07 17:10:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74379 states to 74379 states and 240564 transitions. [2019-12-07 17:10:26,685 INFO L78 Accepts]: Start accepts. Automaton has 74379 states and 240564 transitions. Word has length 16 [2019-12-07 17:10:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:26,685 INFO L462 AbstractCegarLoop]: Abstraction has 74379 states and 240564 transitions. [2019-12-07 17:10:26,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 74379 states and 240564 transitions. [2019-12-07 17:10:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:10:26,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:26,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:26,689 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:26,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:26,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1701491132, now seen corresponding path program 1 times [2019-12-07 17:10:26,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:26,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434174389] [2019-12-07 17:10:26,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:26,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434174389] [2019-12-07 17:10:26,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:26,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:10:26,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929530001] [2019-12-07 17:10:26,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:26,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:26,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:26,744 INFO L87 Difference]: Start difference. First operand 74379 states and 240564 transitions. Second operand 3 states. [2019-12-07 17:10:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:26,990 INFO L93 Difference]: Finished difference Result 74400 states and 240474 transitions. [2019-12-07 17:10:26,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:26,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:10:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:27,109 INFO L225 Difference]: With dead ends: 74400 [2019-12-07 17:10:27,109 INFO L226 Difference]: Without dead ends: 74400 [2019-12-07 17:10:27,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74400 states. [2019-12-07 17:10:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74400 to 74308. [2019-12-07 17:10:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74308 states. [2019-12-07 17:10:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74308 states to 74308 states and 240334 transitions. [2019-12-07 17:10:29,575 INFO L78 Accepts]: Start accepts. Automaton has 74308 states and 240334 transitions. Word has length 16 [2019-12-07 17:10:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:29,576 INFO L462 AbstractCegarLoop]: Abstraction has 74308 states and 240334 transitions. [2019-12-07 17:10:29,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 74308 states and 240334 transitions. [2019-12-07 17:10:29,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:10:29,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:29,580 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 17:10:29,580 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:29,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:29,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1206611411, now seen corresponding path program 1 times [2019-12-07 17:10:29,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:29,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764462895] [2019-12-07 17:10:29,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:29,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764462895] [2019-12-07 17:10:29,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:29,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:10:29,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605167550] [2019-12-07 17:10:29,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:29,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:29,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:29,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:29,622 INFO L87 Difference]: Start difference. First operand 74308 states and 240334 transitions. Second operand 3 states. [2019-12-07 17:10:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:29,832 INFO L93 Difference]: Finished difference Result 69911 states and 225616 transitions. [2019-12-07 17:10:29,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:29,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:10:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:29,947 INFO L225 Difference]: With dead ends: 69911 [2019-12-07 17:10:29,947 INFO L226 Difference]: Without dead ends: 69911 [2019-12-07 17:10:29,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69911 states. [2019-12-07 17:10:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69911 to 69911. [2019-12-07 17:10:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69911 states. [2019-12-07 17:10:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69911 states to 69911 states and 225616 transitions. [2019-12-07 17:10:31,473 INFO L78 Accepts]: Start accepts. Automaton has 69911 states and 225616 transitions. Word has length 17 [2019-12-07 17:10:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:31,473 INFO L462 AbstractCegarLoop]: Abstraction has 69911 states and 225616 transitions. [2019-12-07 17:10:31,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 69911 states and 225616 transitions. [2019-12-07 17:10:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:10:31,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:31,477 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 17:10:31,477 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:31,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash -759251224, now seen corresponding path program 1 times [2019-12-07 17:10:31,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:31,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574621065] [2019-12-07 17:10:31,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:31,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574621065] [2019-12-07 17:10:31,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:31,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:31,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008263367] [2019-12-07 17:10:31,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:31,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:31,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:31,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:31,504 INFO L87 Difference]: Start difference. First operand 69911 states and 225616 transitions. Second operand 4 states. [2019-12-07 17:10:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:31,917 INFO L93 Difference]: Finished difference Result 85438 states and 273755 transitions. [2019-12-07 17:10:31,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:31,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 17:10:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:32,054 INFO L225 Difference]: With dead ends: 85438 [2019-12-07 17:10:32,054 INFO L226 Difference]: Without dead ends: 85438 [2019-12-07 17:10:32,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85438 states. [2019-12-07 17:10:33,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85438 to 70560. [2019-12-07 17:10:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70560 states. [2019-12-07 17:10:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70560 states to 70560 states and 227731 transitions. [2019-12-07 17:10:33,874 INFO L78 Accepts]: Start accepts. Automaton has 70560 states and 227731 transitions. Word has length 17 [2019-12-07 17:10:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:33,874 INFO L462 AbstractCegarLoop]: Abstraction has 70560 states and 227731 transitions. [2019-12-07 17:10:33,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 70560 states and 227731 transitions. [2019-12-07 17:10:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:10:33,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:33,881 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 17:10:33,881 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:33,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:33,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2046192734, now seen corresponding path program 1 times [2019-12-07 17:10:33,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:33,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469064714] [2019-12-07 17:10:33,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:33,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469064714] [2019-12-07 17:10:33,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:33,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:33,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505826044] [2019-12-07 17:10:33,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:33,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:33,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:33,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:33,903 INFO L87 Difference]: Start difference. First operand 70560 states and 227731 transitions. Second operand 3 states. [2019-12-07 17:10:33,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:33,921 INFO L93 Difference]: Finished difference Result 6495 states and 15036 transitions. [2019-12-07 17:10:33,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:33,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:10:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:33,927 INFO L225 Difference]: With dead ends: 6495 [2019-12-07 17:10:33,927 INFO L226 Difference]: Without dead ends: 6495 [2019-12-07 17:10:33,927 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 17:10:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6495 states. [2019-12-07 17:10:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6495 to 6495. [2019-12-07 17:10:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6495 states. [2019-12-07 17:10:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6495 states to 6495 states and 15036 transitions. [2019-12-07 17:10:33,990 INFO L78 Accepts]: Start accepts. Automaton has 6495 states and 15036 transitions. Word has length 20 [2019-12-07 17:10:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:33,990 INFO L462 AbstractCegarLoop]: Abstraction has 6495 states and 15036 transitions. [2019-12-07 17:10:33,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 6495 states and 15036 transitions. [2019-12-07 17:10:33,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:10:33,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:33,992 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 17:10:33,993 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:33,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1258171186, now seen corresponding path program 1 times [2019-12-07 17:10:33,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:33,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633124024] [2019-12-07 17:10:33,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:34,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633124024] [2019-12-07 17:10:34,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:34,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:34,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237326723] [2019-12-07 17:10:34,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:10:34,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:34,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:10:34,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:34,025 INFO L87 Difference]: Start difference. First operand 6495 states and 15036 transitions. Second operand 5 states. [2019-12-07 17:10:34,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:34,287 INFO L93 Difference]: Finished difference Result 8792 states and 19920 transitions. [2019-12-07 17:10:34,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:10:34,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:10:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:34,294 INFO L225 Difference]: With dead ends: 8792 [2019-12-07 17:10:34,294 INFO L226 Difference]: Without dead ends: 8792 [2019-12-07 17:10:34,295 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 17:10:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2019-12-07 17:10:34,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 7888. [2019-12-07 17:10:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7888 states. [2019-12-07 17:10:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7888 states to 7888 states and 18089 transitions. [2019-12-07 17:10:34,375 INFO L78 Accepts]: Start accepts. Automaton has 7888 states and 18089 transitions. Word has length 27 [2019-12-07 17:10:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:34,376 INFO L462 AbstractCegarLoop]: Abstraction has 7888 states and 18089 transitions. [2019-12-07 17:10:34,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:10:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 7888 states and 18089 transitions. [2019-12-07 17:10:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:10:34,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:34,379 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 17:10:34,379 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:34,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:34,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1366134434, now seen corresponding path program 1 times [2019-12-07 17:10:34,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:34,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747370625] [2019-12-07 17:10:34,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:34,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747370625] [2019-12-07 17:10:34,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:34,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:34,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782566252] [2019-12-07 17:10:34,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:34,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:34,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:34,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:34,400 INFO L87 Difference]: Start difference. First operand 7888 states and 18089 transitions. Second operand 3 states. [2019-12-07 17:10:34,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:34,449 INFO L93 Difference]: Finished difference Result 8877 states and 19243 transitions. [2019-12-07 17:10:34,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:34,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 17:10:34,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:34,456 INFO L225 Difference]: With dead ends: 8877 [2019-12-07 17:10:34,456 INFO L226 Difference]: Without dead ends: 8877 [2019-12-07 17:10:34,456 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 17:10:34,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8877 states. [2019-12-07 17:10:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8877 to 7937. [2019-12-07 17:10:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-12-07 17:10:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 17330 transitions. [2019-12-07 17:10:34,534 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 17330 transitions. Word has length 30 [2019-12-07 17:10:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:34,534 INFO L462 AbstractCegarLoop]: Abstraction has 7937 states and 17330 transitions. [2019-12-07 17:10:34,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 17330 transitions. [2019-12-07 17:10:34,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:10:34,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:34,538 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:34,538 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:34,539 INFO L82 PathProgramCache]: Analyzing trace with hash -736726388, now seen corresponding path program 1 times [2019-12-07 17:10:34,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:34,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658304528] [2019-12-07 17:10:34,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:34,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:34,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658304528] [2019-12-07 17:10:34,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:34,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:34,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063981259] [2019-12-07 17:10:34,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:10:34,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:34,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:10:34,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:34,574 INFO L87 Difference]: Start difference. First operand 7937 states and 17330 transitions. Second operand 5 states. [2019-12-07 17:10:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:34,812 INFO L93 Difference]: Finished difference Result 9260 states and 19952 transitions. [2019-12-07 17:10:34,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:10:34,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 17:10:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:34,819 INFO L225 Difference]: With dead ends: 9260 [2019-12-07 17:10:34,819 INFO L226 Difference]: Without dead ends: 9260 [2019-12-07 17:10:34,819 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 17:10:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9260 states. [2019-12-07 17:10:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9260 to 7281. [2019-12-07 17:10:34,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7281 states. [2019-12-07 17:10:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 15997 transitions. [2019-12-07 17:10:34,889 INFO L78 Accepts]: Start accepts. Automaton has 7281 states and 15997 transitions. Word has length 33 [2019-12-07 17:10:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:34,889 INFO L462 AbstractCegarLoop]: Abstraction has 7281 states and 15997 transitions. [2019-12-07 17:10:34,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:10:34,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7281 states and 15997 transitions. [2019-12-07 17:10:34,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 17:10:34,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:34,895 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 17:10:34,895 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1616999435, now seen corresponding path program 1 times [2019-12-07 17:10:34,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:34,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81964127] [2019-12-07 17:10:34,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:34,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81964127] [2019-12-07 17:10:34,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:34,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:10:34,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296721635] [2019-12-07 17:10:34,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:10:34,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:34,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:10:34,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:10:34,937 INFO L87 Difference]: Start difference. First operand 7281 states and 15997 transitions. Second operand 6 states. [2019-12-07 17:10:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:35,285 INFO L93 Difference]: Finished difference Result 9812 states and 20992 transitions. [2019-12-07 17:10:35,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:10:35,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 17:10:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:35,291 INFO L225 Difference]: With dead ends: 9812 [2019-12-07 17:10:35,291 INFO L226 Difference]: Without dead ends: 9811 [2019-12-07 17:10:35,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:10:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9811 states. [2019-12-07 17:10:35,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9811 to 9002. [2019-12-07 17:10:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9002 states. [2019-12-07 17:10:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9002 states to 9002 states and 19455 transitions. [2019-12-07 17:10:35,374 INFO L78 Accepts]: Start accepts. Automaton has 9002 states and 19455 transitions. Word has length 39 [2019-12-07 17:10:35,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:35,374 INFO L462 AbstractCegarLoop]: Abstraction has 9002 states and 19455 transitions. [2019-12-07 17:10:35,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:10:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 9002 states and 19455 transitions. [2019-12-07 17:10:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:10:35,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:35,381 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] [2019-12-07 17:10:35,381 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:35,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:35,381 INFO L82 PathProgramCache]: Analyzing trace with hash 27659275, now seen corresponding path program 1 times [2019-12-07 17:10:35,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:35,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940517860] [2019-12-07 17:10:35,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:35,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940517860] [2019-12-07 17:10:35,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:35,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:10:35,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220674082] [2019-12-07 17:10:35,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:35,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:35,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:35,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:35,438 INFO L87 Difference]: Start difference. First operand 9002 states and 19455 transitions. Second operand 4 states. [2019-12-07 17:10:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:35,460 INFO L93 Difference]: Finished difference Result 9001 states and 19453 transitions. [2019-12-07 17:10:35,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:35,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 17:10:35,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:35,467 INFO L225 Difference]: With dead ends: 9001 [2019-12-07 17:10:35,467 INFO L226 Difference]: Without dead ends: 9001 [2019-12-07 17:10:35,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9001 states. [2019-12-07 17:10:35,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9001 to 9001. [2019-12-07 17:10:35,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9001 states. [2019-12-07 17:10:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9001 states to 9001 states and 19453 transitions. [2019-12-07 17:10:35,545 INFO L78 Accepts]: Start accepts. Automaton has 9001 states and 19453 transitions. Word has length 42 [2019-12-07 17:10:35,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:35,545 INFO L462 AbstractCegarLoop]: Abstraction has 9001 states and 19453 transitions. [2019-12-07 17:10:35,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:35,545 INFO L276 IsEmpty]: Start isEmpty. Operand 9001 states and 19453 transitions. [2019-12-07 17:10:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:10:35,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:35,552 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] [2019-12-07 17:10:35,552 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash 857431396, now seen corresponding path program 1 times [2019-12-07 17:10:35,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:35,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393221498] [2019-12-07 17:10:35,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:35,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393221498] [2019-12-07 17:10:35,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:35,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:35,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323960809] [2019-12-07 17:10:35,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:10:35,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:35,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:10:35,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:35,591 INFO L87 Difference]: Start difference. First operand 9001 states and 19453 transitions. Second operand 5 states. [2019-12-07 17:10:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:35,690 INFO L93 Difference]: Finished difference Result 12765 states and 27710 transitions. [2019-12-07 17:10:35,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:10:35,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-07 17:10:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:35,697 INFO L225 Difference]: With dead ends: 12765 [2019-12-07 17:10:35,698 INFO L226 Difference]: Without dead ends: 10625 [2019-12-07 17:10:35,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:10:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10625 states. [2019-12-07 17:10:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10625 to 10625. [2019-12-07 17:10:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10625 states. [2019-12-07 17:10:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 23072 transitions. [2019-12-07 17:10:35,789 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 23072 transitions. Word has length 43 [2019-12-07 17:10:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:35,790 INFO L462 AbstractCegarLoop]: Abstraction has 10625 states and 23072 transitions. [2019-12-07 17:10:35,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:10:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 23072 transitions. [2019-12-07 17:10:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:10:35,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:35,798 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] [2019-12-07 17:10:35,798 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash 520873357, now seen corresponding path program 1 times [2019-12-07 17:10:35,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:35,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034540612] [2019-12-07 17:10:35,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:35,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034540612] [2019-12-07 17:10:35,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:35,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:35,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653829551] [2019-12-07 17:10:35,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:35,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:35,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:35,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:35,847 INFO L87 Difference]: Start difference. First operand 10625 states and 23072 transitions. Second operand 4 states. [2019-12-07 17:10:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:35,871 INFO L93 Difference]: Finished difference Result 7738 states and 16839 transitions. [2019-12-07 17:10:35,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:35,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 17:10:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:35,877 INFO L225 Difference]: With dead ends: 7738 [2019-12-07 17:10:35,877 INFO L226 Difference]: Without dead ends: 7432 [2019-12-07 17:10:35,878 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 17:10:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7432 states. [2019-12-07 17:10:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7432 to 6292. [2019-12-07 17:10:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6292 states. [2019-12-07 17:10:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6292 states to 6292 states and 13989 transitions. [2019-12-07 17:10:35,943 INFO L78 Accepts]: Start accepts. Automaton has 6292 states and 13989 transitions. Word has length 44 [2019-12-07 17:10:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:35,944 INFO L462 AbstractCegarLoop]: Abstraction has 6292 states and 13989 transitions. [2019-12-07 17:10:35,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6292 states and 13989 transitions. [2019-12-07 17:10:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:10:35,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:35,951 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 17:10:35,951 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:35,951 INFO L82 PathProgramCache]: Analyzing trace with hash 19697383, now seen corresponding path program 1 times [2019-12-07 17:10:35,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:35,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362182634] [2019-12-07 17:10:35,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:36,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362182634] [2019-12-07 17:10:36,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:36,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:10:36,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683070964] [2019-12-07 17:10:36,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:36,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:36,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:36,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:36,010 INFO L87 Difference]: Start difference. First operand 6292 states and 13989 transitions. Second operand 4 states. [2019-12-07 17:10:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:36,163 INFO L93 Difference]: Finished difference Result 5824 states and 12689 transitions. [2019-12-07 17:10:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:36,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 17:10:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:36,167 INFO L225 Difference]: With dead ends: 5824 [2019-12-07 17:10:36,168 INFO L226 Difference]: Without dead ends: 5824 [2019-12-07 17:10:36,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2019-12-07 17:10:36,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 5575. [2019-12-07 17:10:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5575 states. [2019-12-07 17:10:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 12167 transitions. [2019-12-07 17:10:36,216 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 12167 transitions. Word has length 69 [2019-12-07 17:10:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:36,216 INFO L462 AbstractCegarLoop]: Abstraction has 5575 states and 12167 transitions. [2019-12-07 17:10:36,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 12167 transitions. [2019-12-07 17:10:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:10:36,222 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:36,222 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 17:10:36,222 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2066773011, now seen corresponding path program 2 times [2019-12-07 17:10:36,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:36,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740562412] [2019-12-07 17:10:36,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:36,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 17:10:36,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740562412] [2019-12-07 17:10:36,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:36,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:10:36,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705418213] [2019-12-07 17:10:36,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:10:36,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:36,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:10:36,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:10:36,306 INFO L87 Difference]: Start difference. First operand 5575 states and 12167 transitions. Second operand 8 states. [2019-12-07 17:10:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:36,630 INFO L93 Difference]: Finished difference Result 9901 states and 21483 transitions. [2019-12-07 17:10:36,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:10:36,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-12-07 17:10:36,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:36,637 INFO L225 Difference]: With dead ends: 9901 [2019-12-07 17:10:36,637 INFO L226 Difference]: Without dead ends: 9055 [2019-12-07 17:10:36,637 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 17:10:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9055 states. [2019-12-07 17:10:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9055 to 6865. [2019-12-07 17:10:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6865 states. [2019-12-07 17:10:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6865 states to 6865 states and 15169 transitions. [2019-12-07 17:10:36,713 INFO L78 Accepts]: Start accepts. Automaton has 6865 states and 15169 transitions. Word has length 69 [2019-12-07 17:10:36,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:36,713 INFO L462 AbstractCegarLoop]: Abstraction has 6865 states and 15169 transitions. [2019-12-07 17:10:36,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:10:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 6865 states and 15169 transitions. [2019-12-07 17:10:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:10:36,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:36,720 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 17:10:36,720 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:36,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash 738816385, now seen corresponding path program 3 times [2019-12-07 17:10:36,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:36,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590201790] [2019-12-07 17:10:36,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:36,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590201790] [2019-12-07 17:10:36,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:36,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:10:36,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224304286] [2019-12-07 17:10:36,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:10:36,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:36,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:10:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:10:36,804 INFO L87 Difference]: Start difference. First operand 6865 states and 15169 transitions. Second operand 7 states. [2019-12-07 17:10:36,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:36,941 INFO L93 Difference]: Finished difference Result 11003 states and 24235 transitions. [2019-12-07 17:10:36,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:10:36,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-07 17:10:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:36,946 INFO L225 Difference]: With dead ends: 11003 [2019-12-07 17:10:36,947 INFO L226 Difference]: Without dead ends: 9500 [2019-12-07 17:10:36,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:10:36,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9500 states. [2019-12-07 17:10:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9500 to 8262. [2019-12-07 17:10:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8262 states. [2019-12-07 17:10:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8262 states to 8262 states and 18288 transitions. [2019-12-07 17:10:37,021 INFO L78 Accepts]: Start accepts. Automaton has 8262 states and 18288 transitions. Word has length 69 [2019-12-07 17:10:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:37,022 INFO L462 AbstractCegarLoop]: Abstraction has 8262 states and 18288 transitions. [2019-12-07 17:10:37,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:10:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 8262 states and 18288 transitions. [2019-12-07 17:10:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:10:37,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:37,027 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 17:10:37,027 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:37,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:37,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1691415969, now seen corresponding path program 4 times [2019-12-07 17:10:37,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:37,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190562265] [2019-12-07 17:10:37,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:37,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190562265] [2019-12-07 17:10:37,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:37,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:10:37,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826679242] [2019-12-07 17:10:37,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:10:37,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:37,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:10:37,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:10:37,102 INFO L87 Difference]: Start difference. First operand 8262 states and 18288 transitions. Second operand 6 states. [2019-12-07 17:10:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:37,368 INFO L93 Difference]: Finished difference Result 9012 states and 19758 transitions. [2019-12-07 17:10:37,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:10:37,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-07 17:10:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:37,375 INFO L225 Difference]: With dead ends: 9012 [2019-12-07 17:10:37,375 INFO L226 Difference]: Without dead ends: 9012 [2019-12-07 17:10:37,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:10:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9012 states. [2019-12-07 17:10:37,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9012 to 8491. [2019-12-07 17:10:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8491 states. [2019-12-07 17:10:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8491 states to 8491 states and 18702 transitions. [2019-12-07 17:10:37,458 INFO L78 Accepts]: Start accepts. Automaton has 8491 states and 18702 transitions. Word has length 69 [2019-12-07 17:10:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:37,458 INFO L462 AbstractCegarLoop]: Abstraction has 8491 states and 18702 transitions. [2019-12-07 17:10:37,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:10:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 8491 states and 18702 transitions. [2019-12-07 17:10:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:10:37,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:37,463 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 17:10:37,463 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:37,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:37,464 INFO L82 PathProgramCache]: Analyzing trace with hash -705948051, now seen corresponding path program 5 times [2019-12-07 17:10:37,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:37,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110182158] [2019-12-07 17:10:37,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:37,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110182158] [2019-12-07 17:10:37,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:37,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:10:37,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640878739] [2019-12-07 17:10:37,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:10:37,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:37,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:10:37,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:10:37,510 INFO L87 Difference]: Start difference. First operand 8491 states and 18702 transitions. Second operand 6 states. [2019-12-07 17:10:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:37,821 INFO L93 Difference]: Finished difference Result 9271 states and 20206 transitions. [2019-12-07 17:10:37,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:10:37,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-07 17:10:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:37,828 INFO L225 Difference]: With dead ends: 9271 [2019-12-07 17:10:37,828 INFO L226 Difference]: Without dead ends: 9271 [2019-12-07 17:10:37,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:10:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9271 states. [2019-12-07 17:10:37,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9271 to 8985. [2019-12-07 17:10:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8985 states. [2019-12-07 17:10:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8985 states to 8985 states and 19674 transitions. [2019-12-07 17:10:37,917 INFO L78 Accepts]: Start accepts. Automaton has 8985 states and 19674 transitions. Word has length 69 [2019-12-07 17:10:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:37,917 INFO L462 AbstractCegarLoop]: Abstraction has 8985 states and 19674 transitions. [2019-12-07 17:10:37,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:10:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 8985 states and 19674 transitions. [2019-12-07 17:10:37,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 17:10:37,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:37,923 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 17:10:37,923 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:37,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1685253033, now seen corresponding path program 6 times [2019-12-07 17:10:37,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:37,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940964949] [2019-12-07 17:10:37,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:37,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940964949] [2019-12-07 17:10:37,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:37,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:10:37,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652638628] [2019-12-07 17:10:37,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:37,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:37,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:37,976 INFO L87 Difference]: Start difference. First operand 8985 states and 19674 transitions. Second operand 4 states. [2019-12-07 17:10:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:38,016 INFO L93 Difference]: Finished difference Result 9719 states and 21241 transitions. [2019-12-07 17:10:38,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:38,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 17:10:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:38,020 INFO L225 Difference]: With dead ends: 9719 [2019-12-07 17:10:38,020 INFO L226 Difference]: Without dead ends: 5800 [2019-12-07 17:10:38,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5800 states. [2019-12-07 17:10:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5800 to 5223. [2019-12-07 17:10:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5223 states. [2019-12-07 17:10:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5223 states to 5223 states and 11310 transitions. [2019-12-07 17:10:38,067 INFO L78 Accepts]: Start accepts. Automaton has 5223 states and 11310 transitions. Word has length 69 [2019-12-07 17:10:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:38,067 INFO L462 AbstractCegarLoop]: Abstraction has 5223 states and 11310 transitions. [2019-12-07 17:10:38,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 5223 states and 11310 transitions. [2019-12-07 17:10:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 17:10:38,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:38,070 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 17:10:38,071 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:38,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:38,071 INFO L82 PathProgramCache]: Analyzing trace with hash -929833754, now seen corresponding path program 1 times [2019-12-07 17:10:38,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:38,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909571944] [2019-12-07 17:10:38,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:38,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909571944] [2019-12-07 17:10:38,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:38,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:10:38,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21787015] [2019-12-07 17:10:38,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:10:38,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:38,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:10:38,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:10:38,145 INFO L87 Difference]: Start difference. First operand 5223 states and 11310 transitions. Second operand 8 states. [2019-12-07 17:10:38,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:38,381 INFO L93 Difference]: Finished difference Result 8142 states and 17370 transitions. [2019-12-07 17:10:38,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:10:38,381 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-12-07 17:10:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:38,386 INFO L225 Difference]: With dead ends: 8142 [2019-12-07 17:10:38,386 INFO L226 Difference]: Without dead ends: 7683 [2019-12-07 17:10:38,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:10:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7683 states. [2019-12-07 17:10:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7683 to 5271. [2019-12-07 17:10:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5271 states. [2019-12-07 17:10:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5271 states to 5271 states and 11400 transitions. [2019-12-07 17:10:38,441 INFO L78 Accepts]: Start accepts. Automaton has 5271 states and 11400 transitions. Word has length 70 [2019-12-07 17:10:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:38,441 INFO L462 AbstractCegarLoop]: Abstraction has 5271 states and 11400 transitions. [2019-12-07 17:10:38,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:10:38,441 INFO L276 IsEmpty]: Start isEmpty. Operand 5271 states and 11400 transitions. [2019-12-07 17:10:38,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 17:10:38,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:38,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:38,444 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1220286072, now seen corresponding path program 2 times [2019-12-07 17:10:38,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:38,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406388164] [2019-12-07 17:10:38,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:38,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406388164] [2019-12-07 17:10:38,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:38,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:10:38,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140094779] [2019-12-07 17:10:38,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:10:38,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:38,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:10:38,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:10:38,586 INFO L87 Difference]: Start difference. First operand 5271 states and 11400 transitions. Second operand 10 states. [2019-12-07 17:10:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:39,401 INFO L93 Difference]: Finished difference Result 7141 states and 15132 transitions. [2019-12-07 17:10:39,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:10:39,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2019-12-07 17:10:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:39,410 INFO L225 Difference]: With dead ends: 7141 [2019-12-07 17:10:39,410 INFO L226 Difference]: Without dead ends: 7105 [2019-12-07 17:10:39,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:10:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7105 states. [2019-12-07 17:10:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7105 to 6256. [2019-12-07 17:10:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6256 states. [2019-12-07 17:10:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6256 states to 6256 states and 13395 transitions. [2019-12-07 17:10:39,480 INFO L78 Accepts]: Start accepts. Automaton has 6256 states and 13395 transitions. Word has length 70 [2019-12-07 17:10:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:39,481 INFO L462 AbstractCegarLoop]: Abstraction has 6256 states and 13395 transitions. [2019-12-07 17:10:39,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:10:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 6256 states and 13395 transitions. [2019-12-07 17:10:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 17:10:39,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:39,485 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 17:10:39,485 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1670334514, now seen corresponding path program 3 times [2019-12-07 17:10:39,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:39,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140872156] [2019-12-07 17:10:39,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:39,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140872156] [2019-12-07 17:10:39,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:39,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:10:39,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591924700] [2019-12-07 17:10:39,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:10:39,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:39,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:10:39,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:39,552 INFO L87 Difference]: Start difference. First operand 6256 states and 13395 transitions. Second operand 5 states. [2019-12-07 17:10:39,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:39,618 INFO L93 Difference]: Finished difference Result 6760 states and 14359 transitions. [2019-12-07 17:10:39,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:39,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-07 17:10:39,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:39,623 INFO L225 Difference]: With dead ends: 6760 [2019-12-07 17:10:39,623 INFO L226 Difference]: Without dead ends: 6760 [2019-12-07 17:10:39,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:10:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6760 states. [2019-12-07 17:10:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6760 to 6344. [2019-12-07 17:10:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6344 states. [2019-12-07 17:10:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6344 states to 6344 states and 13558 transitions. [2019-12-07 17:10:39,681 INFO L78 Accepts]: Start accepts. Automaton has 6344 states and 13558 transitions. Word has length 70 [2019-12-07 17:10:39,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:39,681 INFO L462 AbstractCegarLoop]: Abstraction has 6344 states and 13558 transitions. [2019-12-07 17:10:39,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:10:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6344 states and 13558 transitions. [2019-12-07 17:10:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 17:10:39,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:39,686 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 17:10:39,686 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:39,686 INFO L82 PathProgramCache]: Analyzing trace with hash 477046829, now seen corresponding path program 1 times [2019-12-07 17:10:39,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:39,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945220439] [2019-12-07 17:10:39,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:10:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:10:39,765 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:10:39,765 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:10:39,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= (store .cse0 |v_ULTIMATE.start_main_~#t1725~0.base_51| 1) |v_#valid_72|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1725~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1725~0.base_51|) |v_ULTIMATE.start_main_~#t1725~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (= v_~y~0_54 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1725~0.base_51|)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t1725~0.offset_32|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1725~0.base_51| 4)) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1725~0.base_51|) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ULTIMATE.start_main_~#t1726~0.base=|v_ULTIMATE.start_main_~#t1726~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, 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|, ULTIMATE.start_main_~#t1725~0.offset=|v_ULTIMATE.start_main_~#t1725~0.offset_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1726~0.offset=|v_ULTIMATE.start_main_~#t1726~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ULTIMATE.start_main_~#t1725~0.base=|v_ULTIMATE.start_main_~#t1725~0.base_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1726~0.base, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t1725~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1726~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1725~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:10:39,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1726~0.base_11| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1726~0.offset_10| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1726~0.base_11|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1726~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1726~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1726~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1726~0.base_11|) |v_ULTIMATE.start_main_~#t1726~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1726~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1726~0.base=|v_ULTIMATE.start_main_~#t1726~0.base_11|, ULTIMATE.start_main_~#t1726~0.offset=|v_ULTIMATE.start_main_~#t1726~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1726~0.base, ULTIMATE.start_main_~#t1726~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 17:10:39,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~x$r_buff1_thd2~0_Out-1573005708 ~x$r_buff0_thd2~0_In-1573005708) (= ~weak$$choice2~0_Out-1573005708 ~x$flush_delayed~0_Out-1573005708) (= ~x$mem_tmp~0_Out-1573005708 ~x~0_In-1573005708) (= ~x$r_buff1_thd0~0_Out-1573005708 ~x$r_buff0_thd0~0_In-1573005708) (= ~x$r_buff0_thd1~0_Out-1573005708 1) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1573005708 0)) (= |P0Thread1of1ForFork1_#t~nondet3_In-1573005708| ~weak$$choice0~0_Out-1573005708) (= ~x$r_buff1_thd1~0_Out-1573005708 ~x$r_buff0_thd1~0_In-1573005708) (= ~weak$$choice2~0_Out-1573005708 |P0Thread1of1ForFork1_#t~nondet4_In-1573005708|)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1573005708, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1573005708, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1573005708, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-1573005708|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1573005708, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-1573005708|, ~x~0=~x~0_In-1573005708} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1573005708, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1573005708, ~x$flush_delayed~0=~x$flush_delayed~0_Out-1573005708, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1573005708, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1573005708, ~x$mem_tmp~0=~x$mem_tmp~0_Out-1573005708, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1573005708, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1573005708, ~weak$$choice0~0=~weak$$choice0~0_Out-1573005708, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1573005708, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-1573005708|, ~weak$$choice2~0=~weak$$choice2~0_Out-1573005708, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-1573005708|, ~x~0=~x~0_In-1573005708} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-07 17:10:39,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1437112845 256))) (.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out1437112845| |P0Thread1of1ForFork1_#t~ite5_Out1437112845|)) (.cse0 (= (mod ~x$w_buff0_used~0_In1437112845 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~x$w_buff1~0_In1437112845 |P0Thread1of1ForFork1_#t~ite5_Out1437112845|)) (and (not .cse1) .cse2 (not .cse0) (= ~x$w_buff0~0_In1437112845 |P0Thread1of1ForFork1_#t~ite5_Out1437112845|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1437112845, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1437112845, ~x$w_buff1~0=~x$w_buff1~0_In1437112845, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1437112845} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1437112845, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1437112845|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1437112845, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1437112845|, ~x$w_buff1~0=~x$w_buff1~0_In1437112845, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1437112845} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 17:10:39,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$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|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 17:10:39,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In2135650732 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out2135650732| ~x$mem_tmp~0_In2135650732)) (and .cse0 (= ~x~0_In2135650732 |P0Thread1of1ForFork1_#t~ite25_Out2135650732|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In2135650732, ~x$mem_tmp~0=~x$mem_tmp~0_In2135650732, ~x~0=~x~0_In2135650732} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out2135650732|, ~x$flush_delayed~0=~x$flush_delayed~0_In2135650732, ~x$mem_tmp~0=~x$mem_tmp~0_In2135650732, ~x~0=~x~0_In2135650732} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:10:39,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In490499742 256) 0))) (or (and (not .cse0) (= ~x$mem_tmp~0_In490499742 |P1Thread1of1ForFork0_#t~ite54_Out490499742|)) (and (= ~x~0_In490499742 |P1Thread1of1ForFork0_#t~ite54_Out490499742|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In490499742, ~x$mem_tmp~0=~x$mem_tmp~0_In490499742, ~x~0=~x~0_In490499742} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out490499742|, ~x$flush_delayed~0=~x$flush_delayed~0_In490499742, ~x$mem_tmp~0=~x$mem_tmp~0_In490499742, ~x~0=~x~0_In490499742} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:10:39,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1857922483 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1857922483 256) 0))) (or (and (= ~x$w_buff1~0_In1857922483 |P1Thread1of1ForFork0_#t~ite55_Out1857922483|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In1857922483 |P1Thread1of1ForFork0_#t~ite55_Out1857922483|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1857922483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1857922483, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1857922483, ~x~0=~x~0_In1857922483} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1857922483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1857922483, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1857922483, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out1857922483|, ~x~0=~x~0_In1857922483} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 17:10:39,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |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|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-07 17:10:39,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1694875908 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1694875908 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out1694875908| 0)) (and (= |P1Thread1of1ForFork0_#t~ite57_Out1694875908| ~x$w_buff0_used~0_In1694875908) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1694875908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1694875908} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out1694875908|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1694875908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1694875908} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 17:10:39,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1153236739 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1153236739 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1153236739 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1153236739 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite58_Out-1153236739| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite58_Out-1153236739| ~x$w_buff1_used~0_In-1153236739) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1153236739, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1153236739, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1153236739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1153236739} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out-1153236739|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1153236739, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1153236739, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1153236739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1153236739} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 17:10:39,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2121374155 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2121374155 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In2121374155 |P1Thread1of1ForFork0_#t~ite59_Out2121374155|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite59_Out2121374155|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2121374155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121374155} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2121374155, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out2121374155|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121374155} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 17:10:39,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-217950207 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-217950207 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-217950207 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-217950207 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite60_Out-217950207| ~x$r_buff1_thd2~0_In-217950207) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite60_Out-217950207|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-217950207, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-217950207, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-217950207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-217950207} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-217950207|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-217950207, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-217950207, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-217950207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-217950207} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 17:10:39,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__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[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 17:10:39,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1320713270 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1320713270 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite28_Out-1320713270| ~x$w_buff0_used~0_In-1320713270) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite28_Out-1320713270| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1320713270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1320713270} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1320713270, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-1320713270|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1320713270} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 17:10:39,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1301146302 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1301146302 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1301146302 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1301146302 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite29_Out1301146302| ~x$w_buff1_used~0_In1301146302)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite29_Out1301146302| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1301146302, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1301146302, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1301146302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1301146302} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1301146302, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out1301146302|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1301146302, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1301146302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1301146302} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 17:10:39,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1603845191 256))) (.cse0 (= ~x$r_buff0_thd1~0_In-1603845191 ~x$r_buff0_thd1~0_Out-1603845191)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1603845191 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (= 0 ~x$r_buff0_thd1~0_Out-1603845191) (not .cse1)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1603845191, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603845191} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1603845191, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-1603845191|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603845191} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:10:39,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-205077547 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-205077547 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-205077547 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-205077547 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out-205077547|)) (and (= ~x$r_buff1_thd1~0_In-205077547 |P0Thread1of1ForFork1_#t~ite31_Out-205077547|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-205077547, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-205077547, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-205077547, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-205077547} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-205077547, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-205077547, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-205077547, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-205077547|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-205077547} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:10:39,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:10:39,780 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 17:10:39,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-585960630 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-585960630 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite63_Out-585960630| |ULTIMATE.start_main_#t~ite64_Out-585960630|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite63_Out-585960630| ~x$w_buff1~0_In-585960630)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-585960630| ~x~0_In-585960630) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-585960630, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-585960630, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-585960630, ~x~0=~x~0_In-585960630} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-585960630|, ~x$w_buff1~0=~x$w_buff1~0_In-585960630, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-585960630, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-585960630, ~x~0=~x~0_In-585960630, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-585960630|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:10:39,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1413435869 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1413435869 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite65_Out1413435869| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite65_Out1413435869| ~x$w_buff0_used~0_In1413435869)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1413435869, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1413435869} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1413435869, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1413435869|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1413435869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 17:10:39,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1786580739 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1786580739 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1786580739 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1786580739 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite66_Out1786580739|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1786580739 |ULTIMATE.start_main_#t~ite66_Out1786580739|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1786580739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1786580739, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1786580739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1786580739} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1786580739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1786580739, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1786580739|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1786580739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1786580739} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 17:10:39,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In425411087 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In425411087 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In425411087 |ULTIMATE.start_main_#t~ite67_Out425411087|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite67_Out425411087|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In425411087, ~x$w_buff0_used~0=~x$w_buff0_used~0_In425411087} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In425411087, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out425411087|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In425411087} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 17:10:39,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1787775059 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1787775059 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1787775059 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1787775059 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out-1787775059|)) (and (= ~x$r_buff1_thd0~0_In-1787775059 |ULTIMATE.start_main_#t~ite68_Out-1787775059|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1787775059, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1787775059, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1787775059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1787775059} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1787775059, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1787775059, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1787775059|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1787775059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1787775059} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 17:10:39,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] 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_~main$tmp_guard1~0_40 (ite (= (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} 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_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$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, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:10:39,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:10:39 BasicIcfg [2019-12-07 17:10:39,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:10:39,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:10:39,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:10:39,841 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:10:39,841 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:12" (3/4) ... [2019-12-07 17:10:39,843 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:10:39,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= (store .cse0 |v_ULTIMATE.start_main_~#t1725~0.base_51| 1) |v_#valid_72|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1725~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1725~0.base_51|) |v_ULTIMATE.start_main_~#t1725~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (= v_~y~0_54 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1725~0.base_51|)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t1725~0.offset_32|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1725~0.base_51| 4)) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1725~0.base_51|) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ULTIMATE.start_main_~#t1726~0.base=|v_ULTIMATE.start_main_~#t1726~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, 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|, ULTIMATE.start_main_~#t1725~0.offset=|v_ULTIMATE.start_main_~#t1725~0.offset_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1726~0.offset=|v_ULTIMATE.start_main_~#t1726~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ULTIMATE.start_main_~#t1725~0.base=|v_ULTIMATE.start_main_~#t1725~0.base_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1726~0.base, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t1725~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1726~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1725~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 17:10:39,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1726~0.base_11| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1726~0.offset_10| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1726~0.base_11|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1726~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1726~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1726~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1726~0.base_11|) |v_ULTIMATE.start_main_~#t1726~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1726~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1726~0.base=|v_ULTIMATE.start_main_~#t1726~0.base_11|, ULTIMATE.start_main_~#t1726~0.offset=|v_ULTIMATE.start_main_~#t1726~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1726~0.base, ULTIMATE.start_main_~#t1726~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 17:10:39,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~x$r_buff1_thd2~0_Out-1573005708 ~x$r_buff0_thd2~0_In-1573005708) (= ~weak$$choice2~0_Out-1573005708 ~x$flush_delayed~0_Out-1573005708) (= ~x$mem_tmp~0_Out-1573005708 ~x~0_In-1573005708) (= ~x$r_buff1_thd0~0_Out-1573005708 ~x$r_buff0_thd0~0_In-1573005708) (= ~x$r_buff0_thd1~0_Out-1573005708 1) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1573005708 0)) (= |P0Thread1of1ForFork1_#t~nondet3_In-1573005708| ~weak$$choice0~0_Out-1573005708) (= ~x$r_buff1_thd1~0_Out-1573005708 ~x$r_buff0_thd1~0_In-1573005708) (= ~weak$$choice2~0_Out-1573005708 |P0Thread1of1ForFork1_#t~nondet4_In-1573005708|)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1573005708, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1573005708, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1573005708, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-1573005708|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1573005708, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-1573005708|, ~x~0=~x~0_In-1573005708} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1573005708, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1573005708, ~x$flush_delayed~0=~x$flush_delayed~0_Out-1573005708, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1573005708, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1573005708, ~x$mem_tmp~0=~x$mem_tmp~0_Out-1573005708, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1573005708, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1573005708, ~weak$$choice0~0=~weak$$choice0~0_Out-1573005708, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1573005708, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-1573005708|, ~weak$$choice2~0=~weak$$choice2~0_Out-1573005708, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-1573005708|, ~x~0=~x~0_In-1573005708} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-07 17:10:39,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1437112845 256))) (.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out1437112845| |P0Thread1of1ForFork1_#t~ite5_Out1437112845|)) (.cse0 (= (mod ~x$w_buff0_used~0_In1437112845 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~x$w_buff1~0_In1437112845 |P0Thread1of1ForFork1_#t~ite5_Out1437112845|)) (and (not .cse1) .cse2 (not .cse0) (= ~x$w_buff0~0_In1437112845 |P0Thread1of1ForFork1_#t~ite5_Out1437112845|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1437112845, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1437112845, ~x$w_buff1~0=~x$w_buff1~0_In1437112845, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1437112845} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1437112845, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1437112845|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1437112845, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1437112845|, ~x$w_buff1~0=~x$w_buff1~0_In1437112845, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1437112845} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 17:10:39,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$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|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 17:10:39,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In2135650732 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out2135650732| ~x$mem_tmp~0_In2135650732)) (and .cse0 (= ~x~0_In2135650732 |P0Thread1of1ForFork1_#t~ite25_Out2135650732|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In2135650732, ~x$mem_tmp~0=~x$mem_tmp~0_In2135650732, ~x~0=~x~0_In2135650732} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out2135650732|, ~x$flush_delayed~0=~x$flush_delayed~0_In2135650732, ~x$mem_tmp~0=~x$mem_tmp~0_In2135650732, ~x~0=~x~0_In2135650732} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 17:10:39,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In490499742 256) 0))) (or (and (not .cse0) (= ~x$mem_tmp~0_In490499742 |P1Thread1of1ForFork0_#t~ite54_Out490499742|)) (and (= ~x~0_In490499742 |P1Thread1of1ForFork0_#t~ite54_Out490499742|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In490499742, ~x$mem_tmp~0=~x$mem_tmp~0_In490499742, ~x~0=~x~0_In490499742} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out490499742|, ~x$flush_delayed~0=~x$flush_delayed~0_In490499742, ~x$mem_tmp~0=~x$mem_tmp~0_In490499742, ~x~0=~x~0_In490499742} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:10:39,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1857922483 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1857922483 256) 0))) (or (and (= ~x$w_buff1~0_In1857922483 |P1Thread1of1ForFork0_#t~ite55_Out1857922483|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In1857922483 |P1Thread1of1ForFork0_#t~ite55_Out1857922483|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1857922483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1857922483, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1857922483, ~x~0=~x~0_In1857922483} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1857922483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1857922483, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1857922483, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out1857922483|, ~x~0=~x~0_In1857922483} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 17:10:39,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |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|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-07 17:10:39,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1694875908 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1694875908 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out1694875908| 0)) (and (= |P1Thread1of1ForFork0_#t~ite57_Out1694875908| ~x$w_buff0_used~0_In1694875908) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1694875908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1694875908} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out1694875908|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1694875908, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1694875908} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 17:10:39,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1153236739 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1153236739 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1153236739 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1153236739 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite58_Out-1153236739| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork0_#t~ite58_Out-1153236739| ~x$w_buff1_used~0_In-1153236739) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1153236739, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1153236739, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1153236739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1153236739} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out-1153236739|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1153236739, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1153236739, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1153236739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1153236739} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 17:10:39,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In2121374155 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In2121374155 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In2121374155 |P1Thread1of1ForFork0_#t~ite59_Out2121374155|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite59_Out2121374155|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2121374155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121374155} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2121374155, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out2121374155|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2121374155} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 17:10:39,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-217950207 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-217950207 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-217950207 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-217950207 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite60_Out-217950207| ~x$r_buff1_thd2~0_In-217950207) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite60_Out-217950207|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-217950207, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-217950207, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-217950207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-217950207} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-217950207|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-217950207, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-217950207, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-217950207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-217950207} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 17:10:39,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__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[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 17:10:39,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1320713270 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1320713270 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite28_Out-1320713270| ~x$w_buff0_used~0_In-1320713270) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite28_Out-1320713270| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1320713270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1320713270} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1320713270, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-1320713270|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1320713270} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 17:10:39,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1301146302 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1301146302 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1301146302 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1301146302 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite29_Out1301146302| ~x$w_buff1_used~0_In1301146302)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite29_Out1301146302| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1301146302, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1301146302, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1301146302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1301146302} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1301146302, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out1301146302|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1301146302, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1301146302, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1301146302} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 17:10:39,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1603845191 256))) (.cse0 (= ~x$r_buff0_thd1~0_In-1603845191 ~x$r_buff0_thd1~0_Out-1603845191)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1603845191 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (= 0 ~x$r_buff0_thd1~0_Out-1603845191) (not .cse1)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1603845191, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603845191} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1603845191, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-1603845191|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1603845191} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:10:39,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-205077547 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-205077547 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-205077547 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-205077547 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out-205077547|)) (and (= ~x$r_buff1_thd1~0_In-205077547 |P0Thread1of1ForFork1_#t~ite31_Out-205077547|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-205077547, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-205077547, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-205077547, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-205077547} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-205077547, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-205077547, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-205077547, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-205077547|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-205077547} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:10:39,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 17:10:39,855 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 17:10:39,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-585960630 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-585960630 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite63_Out-585960630| |ULTIMATE.start_main_#t~ite64_Out-585960630|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite63_Out-585960630| ~x$w_buff1~0_In-585960630)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-585960630| ~x~0_In-585960630) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-585960630, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-585960630, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-585960630, ~x~0=~x~0_In-585960630} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-585960630|, ~x$w_buff1~0=~x$w_buff1~0_In-585960630, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-585960630, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-585960630, ~x~0=~x~0_In-585960630, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-585960630|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:10:39,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1413435869 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1413435869 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite65_Out1413435869| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite65_Out1413435869| ~x$w_buff0_used~0_In1413435869)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1413435869, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1413435869} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1413435869, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1413435869|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1413435869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 17:10:39,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1786580739 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1786580739 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1786580739 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1786580739 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite66_Out1786580739|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1786580739 |ULTIMATE.start_main_#t~ite66_Out1786580739|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1786580739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1786580739, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1786580739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1786580739} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1786580739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1786580739, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1786580739|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1786580739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1786580739} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 17:10:39,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In425411087 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In425411087 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In425411087 |ULTIMATE.start_main_#t~ite67_Out425411087|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite67_Out425411087|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In425411087, ~x$w_buff0_used~0=~x$w_buff0_used~0_In425411087} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In425411087, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out425411087|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In425411087} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 17:10:39,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1787775059 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1787775059 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1787775059 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1787775059 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out-1787775059|)) (and (= ~x$r_buff1_thd0~0_In-1787775059 |ULTIMATE.start_main_#t~ite68_Out-1787775059|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1787775059, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1787775059, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1787775059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1787775059} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1787775059, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1787775059, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-1787775059|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1787775059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1787775059} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 17:10:39,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] 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_~main$tmp_guard1~0_40 (ite (= (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} 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_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$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, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:10:39,917 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a868cd7a-10bd-4873-8b3e-359d786b5cec/bin/uautomizer/witness.graphml [2019-12-07 17:10:39,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:10:39,918 INFO L168 Benchmark]: Toolchain (without parser) took 28805.60 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 938.1 MB in the beginning and 2.2 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 17:10:39,918 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:10:39,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:39,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:10:39,919 INFO L168 Benchmark]: Boogie Preprocessor took 27.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:39,919 INFO L168 Benchmark]: RCFGBuilder took 447.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:39,919 INFO L168 Benchmark]: TraceAbstraction took 27817.89 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 17:10:39,920 INFO L168 Benchmark]: Witness Printer took 76.06 ms. Allocated memory is still 4.1 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:39,921 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 447.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27817.89 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 76.06 ms. Allocated memory is still 4.1 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.6 MB). Peak memory consumption was 54.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, 9685 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(&t1725, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1726, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$w_buff1 = x$w_buff0 [L730] 1 x$w_buff0 = 1 [L731] 1 x$w_buff1_used = x$w_buff0_used [L732] 1 x$w_buff0_used = (_Bool)1 [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$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, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = 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=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 x$flush_delayed = weak$$choice2 [L782] 2 x$mem_tmp = x 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L784] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L786] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$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 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$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 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = x 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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L791] 2 x = x$flush_delayed ? x$mem_tmp : x [L792] 2 x$flush_delayed = (_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, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 27.6s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5827 SDtfs, 5651 SDslu, 12267 SDs, 0 SdLazy, 4659 SolverSat, 212 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 49 SyntacticMatches, 8 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s 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: 13.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 46587 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1082 NumberOfCodeBlocks, 1082 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 986 ConstructedInterpolants, 0 QuantifiedInterpolants, 301046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...