./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_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_e9c945fd-fd31-4e18-ace8-9416020fda48/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/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 e240743ef63f1bd987770483bd8cde6bb90b3dd2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:01:32,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:01:32,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:01:32,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:01:32,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:01:32,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:01:32,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:01:32,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:01:32,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:01:32,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:01:32,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:01:32,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:01:32,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:01:32,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:01:32,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:01:32,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:01:32,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:01:32,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:01:32,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:01:32,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:01:32,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:01:32,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:01:32,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:01:32,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:01:32,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:01:32,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:01:32,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:01:32,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:01:32,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:01:32,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:01:32,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:01:32,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:01:32,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:01:32,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:01:32,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:01:32,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:01:32,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:01:32,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:01:32,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:01:32,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:01:32,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:01:32,642 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 19:01:32,652 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:01:32,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:01:32,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:01:32,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:01:32,653 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 19:01:32,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:01:32,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:01:32,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:01:32,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:01:32,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:01:32,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:01:32,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:01:32,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:01:32,654 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:01:32,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:01:32,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:01:32,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:01:32,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:01:32,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:01:32,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:01:32,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:01:32,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:01:32,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:01:32,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:01:32,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:01:32,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 19:01:32,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:01:32,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:01:32,656 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:01:32,656 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_e9c945fd-fd31-4e18-ace8-9416020fda48/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 -> e240743ef63f1bd987770483bd8cde6bb90b3dd2 [2019-12-07 19:01:32,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:01:32,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:01:32,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:01:32,771 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:01:32,772 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:01:32,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe031_pso.oepc.i [2019-12-07 19:01:32,813 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/bin/uautomizer/data/8f3b16f16/46d18d132fdc480593ec32b9f343f85e/FLAG0a5c7e475 [2019-12-07 19:01:33,205 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:01:33,206 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/sv-benchmarks/c/pthread-wmm/safe031_pso.oepc.i [2019-12-07 19:01:33,216 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/bin/uautomizer/data/8f3b16f16/46d18d132fdc480593ec32b9f343f85e/FLAG0a5c7e475 [2019-12-07 19:01:33,566 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/bin/uautomizer/data/8f3b16f16/46d18d132fdc480593ec32b9f343f85e [2019-12-07 19:01:33,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:01:33,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:01:33,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:01:33,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:01:33,577 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:01:33,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:01:33" (1/1) ... [2019-12-07 19:01:33,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2133a45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33, skipping insertion in model container [2019-12-07 19:01:33,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:01:33" (1/1) ... [2019-12-07 19:01:33,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:01:33,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:01:33,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:01:33,889 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:01:33,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:01:33,977 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:01:33,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33 WrapperNode [2019-12-07 19:01:33,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:01:33,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:01:33,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:01:33,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:01:33,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33" (1/1) ... [2019-12-07 19:01:33,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33" (1/1) ... [2019-12-07 19:01:34,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:01:34,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:01:34,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:01:34,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:01:34,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33" (1/1) ... [2019-12-07 19:01:34,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33" (1/1) ... [2019-12-07 19:01:34,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33" (1/1) ... [2019-12-07 19:01:34,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33" (1/1) ... [2019-12-07 19:01:34,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33" (1/1) ... [2019-12-07 19:01:34,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33" (1/1) ... [2019-12-07 19:01:34,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33" (1/1) ... [2019-12-07 19:01:34,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:01:34,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:01:34,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:01:34,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:01:34,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/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 19:01:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:01:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:01:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:01:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:01:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:01:34,081 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:01:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:01:34,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:01:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:01:34,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:01:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:01:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:01:34,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:01:34,084 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 19:01:34,429 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:01:34,429 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:01:34,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:34 BoogieIcfgContainer [2019-12-07 19:01:34,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:01:34,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:01:34,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:01:34,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:01:34,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:01:33" (1/3) ... [2019-12-07 19:01:34,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5823da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:01:34, skipping insertion in model container [2019-12-07 19:01:34,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:33" (2/3) ... [2019-12-07 19:01:34,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5823da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:01:34, skipping insertion in model container [2019-12-07 19:01:34,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:34" (3/3) ... [2019-12-07 19:01:34,435 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_pso.oepc.i [2019-12-07 19:01:34,441 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:01:34,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:01:34,446 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:01:34,446 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:01:34,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,472 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,472 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,478 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,489 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,489 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,489 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,490 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,490 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,495 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,495 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:01:34,512 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 19:01:34,524 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:01:34,524 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:01:34,525 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:01:34,525 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:01:34,525 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:01:34,525 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:01:34,525 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:01:34,525 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:01:34,535 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-07 19:01:34,536 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-07 19:01:34,587 INFO L134 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-07 19:01:34,587 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:01:34,597 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 713 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:01:34,610 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-07 19:01:34,639 INFO L134 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-07 19:01:34,639 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:01:34,644 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 713 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 19:01:34,659 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 19:01:34,660 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:01:37,720 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 19:01:37,810 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64880 [2019-12-07 19:01:37,811 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 19:01:37,813 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-07 19:01:46,914 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83222 states. [2019-12-07 19:01:46,915 INFO L276 IsEmpty]: Start isEmpty. Operand 83222 states. [2019-12-07 19:01:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 19:01:46,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:46,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 19:01:46,920 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:46,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:46,924 INFO L82 PathProgramCache]: Analyzing trace with hash 793650723, now seen corresponding path program 1 times [2019-12-07 19:01:46,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:46,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510157660] [2019-12-07 19:01:46,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:47,064 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 19:01:47,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510157660] [2019-12-07 19:01:47,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:47,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:01:47,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825242186] [2019-12-07 19:01:47,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:47,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:47,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:47,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:47,079 INFO L87 Difference]: Start difference. First operand 83222 states. Second operand 3 states. [2019-12-07 19:01:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:47,720 INFO L93 Difference]: Finished difference Result 82272 states and 355122 transitions. [2019-12-07 19:01:47,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:47,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 19:01:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:48,155 INFO L225 Difference]: With dead ends: 82272 [2019-12-07 19:01:48,156 INFO L226 Difference]: Without dead ends: 77232 [2019-12-07 19:01:48,156 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 19:01:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77232 states. [2019-12-07 19:01:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77232 to 77232. [2019-12-07 19:01:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77232 states. [2019-12-07 19:01:52,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77232 states to 77232 states and 332862 transitions. [2019-12-07 19:01:52,368 INFO L78 Accepts]: Start accepts. Automaton has 77232 states and 332862 transitions. Word has length 5 [2019-12-07 19:01:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:52,368 INFO L462 AbstractCegarLoop]: Abstraction has 77232 states and 332862 transitions. [2019-12-07 19:01:52,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 77232 states and 332862 transitions. [2019-12-07 19:01:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:01:52,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:52,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:52,374 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:52,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:52,375 INFO L82 PathProgramCache]: Analyzing trace with hash -187432799, now seen corresponding path program 1 times [2019-12-07 19:01:52,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:52,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255974798] [2019-12-07 19:01:52,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:52,433 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 19:01:52,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255974798] [2019-12-07 19:01:52,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:52,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:01:52,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088713013] [2019-12-07 19:01:52,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:52,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:52,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:52,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:52,436 INFO L87 Difference]: Start difference. First operand 77232 states and 332862 transitions. Second operand 4 states. [2019-12-07 19:01:53,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:53,309 INFO L93 Difference]: Finished difference Result 119112 states and 491884 transitions. [2019-12-07 19:01:53,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:01:53,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:01:53,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:53,625 INFO L225 Difference]: With dead ends: 119112 [2019-12-07 19:01:53,626 INFO L226 Difference]: Without dead ends: 119007 [2019-12-07 19:01:53,626 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 19:01:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119007 states. [2019-12-07 19:01:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119007 to 111499. [2019-12-07 19:01:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111499 states. [2019-12-07 19:02:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111499 states to 111499 states and 464543 transitions. [2019-12-07 19:02:00,221 INFO L78 Accepts]: Start accepts. Automaton has 111499 states and 464543 transitions. Word has length 13 [2019-12-07 19:02:00,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:00,222 INFO L462 AbstractCegarLoop]: Abstraction has 111499 states and 464543 transitions. [2019-12-07 19:02:00,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 111499 states and 464543 transitions. [2019-12-07 19:02:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:02:00,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:00,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:00,225 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:00,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:00,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1509262706, now seen corresponding path program 1 times [2019-12-07 19:02:00,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:00,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734377438] [2019-12-07 19:02:00,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:00,271 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 19:02:00,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734377438] [2019-12-07 19:02:00,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:00,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:02:00,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573821233] [2019-12-07 19:02:00,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:00,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:00,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:00,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:00,272 INFO L87 Difference]: Start difference. First operand 111499 states and 464543 transitions. Second operand 4 states. [2019-12-07 19:02:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:01,454 INFO L93 Difference]: Finished difference Result 158605 states and 645510 transitions. [2019-12-07 19:02:01,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:02:01,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 19:02:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:01,828 INFO L225 Difference]: With dead ends: 158605 [2019-12-07 19:02:01,829 INFO L226 Difference]: Without dead ends: 158485 [2019-12-07 19:02:01,829 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 19:02:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158485 states. [2019-12-07 19:02:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158485 to 134738. [2019-12-07 19:02:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134738 states. [2019-12-07 19:02:09,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134738 states to 134738 states and 557345 transitions. [2019-12-07 19:02:09,410 INFO L78 Accepts]: Start accepts. Automaton has 134738 states and 557345 transitions. Word has length 13 [2019-12-07 19:02:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:09,410 INFO L462 AbstractCegarLoop]: Abstraction has 134738 states and 557345 transitions. [2019-12-07 19:02:09,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 134738 states and 557345 transitions. [2019-12-07 19:02:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:02:09,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:09,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:09,413 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:09,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:09,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2053226586, now seen corresponding path program 1 times [2019-12-07 19:02:09,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:09,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045501520] [2019-12-07 19:02:09,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:09,460 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 19:02:09,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045501520] [2019-12-07 19:02:09,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:09,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:09,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751490755] [2019-12-07 19:02:09,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:02:09,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:09,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:02:09,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:09,462 INFO L87 Difference]: Start difference. First operand 134738 states and 557345 transitions. Second operand 5 states. [2019-12-07 19:02:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:10,648 INFO L93 Difference]: Finished difference Result 183165 states and 744415 transitions. [2019-12-07 19:02:10,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:02:10,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 19:02:10,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:11,091 INFO L225 Difference]: With dead ends: 183165 [2019-12-07 19:02:11,091 INFO L226 Difference]: Without dead ends: 183013 [2019-12-07 19:02:11,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:02:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183013 states. [2019-12-07 19:02:17,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183013 to 148564. [2019-12-07 19:02:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148564 states. [2019-12-07 19:02:17,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148564 states to 148564 states and 613463 transitions. [2019-12-07 19:02:17,965 INFO L78 Accepts]: Start accepts. Automaton has 148564 states and 613463 transitions. Word has length 14 [2019-12-07 19:02:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:17,965 INFO L462 AbstractCegarLoop]: Abstraction has 148564 states and 613463 transitions. [2019-12-07 19:02:17,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:02:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 148564 states and 613463 transitions. [2019-12-07 19:02:17,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:02:17,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:17,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:17,981 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2099469612, now seen corresponding path program 1 times [2019-12-07 19:02:17,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:17,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380035370] [2019-12-07 19:02:17,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:18,033 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 19:02:18,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380035370] [2019-12-07 19:02:18,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:18,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:02:18,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514627982] [2019-12-07 19:02:18,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:18,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:18,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:18,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:18,034 INFO L87 Difference]: Start difference. First operand 148564 states and 613463 transitions. Second operand 3 states. [2019-12-07 19:02:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:19,045 INFO L93 Difference]: Finished difference Result 148564 states and 607673 transitions. [2019-12-07 19:02:19,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:19,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 19:02:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:19,409 INFO L225 Difference]: With dead ends: 148564 [2019-12-07 19:02:19,409 INFO L226 Difference]: Without dead ends: 148564 [2019-12-07 19:02:19,410 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 19:02:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148564 states. [2019-12-07 19:02:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148564 to 146584. [2019-12-07 19:02:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146584 states. [2019-12-07 19:02:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146584 states to 146584 states and 600131 transitions. [2019-12-07 19:02:27,281 INFO L78 Accepts]: Start accepts. Automaton has 146584 states and 600131 transitions. Word has length 18 [2019-12-07 19:02:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:27,282 INFO L462 AbstractCegarLoop]: Abstraction has 146584 states and 600131 transitions. [2019-12-07 19:02:27,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:27,282 INFO L276 IsEmpty]: Start isEmpty. Operand 146584 states and 600131 transitions. [2019-12-07 19:02:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:02:27,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:27,292 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:27,292 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2089612406, now seen corresponding path program 1 times [2019-12-07 19:02:27,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:27,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034083621] [2019-12-07 19:02:27,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:27,351 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 19:02:27,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034083621] [2019-12-07 19:02:27,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:27,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:02:27,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564954544] [2019-12-07 19:02:27,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:27,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:27,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:27,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:27,353 INFO L87 Difference]: Start difference. First operand 146584 states and 600131 transitions. Second operand 3 states. [2019-12-07 19:02:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:28,542 INFO L93 Difference]: Finished difference Result 272448 states and 1107573 transitions. [2019-12-07 19:02:28,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:28,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 19:02:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:29,688 INFO L225 Difference]: With dead ends: 272448 [2019-12-07 19:02:29,689 INFO L226 Difference]: Without dead ends: 261792 [2019-12-07 19:02:29,689 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 19:02:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261792 states. [2019-12-07 19:02:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261792 to 250613. [2019-12-07 19:02:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250613 states. [2019-12-07 19:02:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250613 states to 250613 states and 1027376 transitions. [2019-12-07 19:02:39,624 INFO L78 Accepts]: Start accepts. Automaton has 250613 states and 1027376 transitions. Word has length 18 [2019-12-07 19:02:39,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:39,624 INFO L462 AbstractCegarLoop]: Abstraction has 250613 states and 1027376 transitions. [2019-12-07 19:02:39,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 250613 states and 1027376 transitions. [2019-12-07 19:02:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:02:39,645 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:39,645 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:39,645 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:39,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:39,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1438263838, now seen corresponding path program 1 times [2019-12-07 19:02:39,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:39,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646097059] [2019-12-07 19:02:39,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:39,666 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 19:02:39,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646097059] [2019-12-07 19:02:39,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:39,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:02:39,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12295997] [2019-12-07 19:02:39,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:39,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:39,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:39,667 INFO L87 Difference]: Start difference. First operand 250613 states and 1027376 transitions. Second operand 3 states. [2019-12-07 19:02:39,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:39,808 INFO L93 Difference]: Finished difference Result 48671 states and 160112 transitions. [2019-12-07 19:02:39,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:39,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 19:02:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:39,878 INFO L225 Difference]: With dead ends: 48671 [2019-12-07 19:02:39,878 INFO L226 Difference]: Without dead ends: 48671 [2019-12-07 19:02:39,878 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 19:02:40,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48671 states. [2019-12-07 19:02:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48671 to 48671. [2019-12-07 19:02:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48671 states. [2019-12-07 19:02:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48671 states to 48671 states and 160112 transitions. [2019-12-07 19:02:40,630 INFO L78 Accepts]: Start accepts. Automaton has 48671 states and 160112 transitions. Word has length 19 [2019-12-07 19:02:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:40,630 INFO L462 AbstractCegarLoop]: Abstraction has 48671 states and 160112 transitions. [2019-12-07 19:02:40,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 48671 states and 160112 transitions. [2019-12-07 19:02:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:02:40,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:40,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:40,639 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:40,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:40,640 INFO L82 PathProgramCache]: Analyzing trace with hash 112714396, now seen corresponding path program 1 times [2019-12-07 19:02:40,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:40,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573839192] [2019-12-07 19:02:40,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:40,687 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 19:02:40,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573839192] [2019-12-07 19:02:40,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:40,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:02:40,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198948534] [2019-12-07 19:02:40,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:02:40,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:40,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:02:40,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:02:40,689 INFO L87 Difference]: Start difference. First operand 48671 states and 160112 transitions. Second operand 6 states. [2019-12-07 19:02:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:41,212 INFO L93 Difference]: Finished difference Result 68053 states and 219263 transitions. [2019-12-07 19:02:41,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:02:41,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 19:02:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:41,312 INFO L225 Difference]: With dead ends: 68053 [2019-12-07 19:02:41,313 INFO L226 Difference]: Without dead ends: 67939 [2019-12-07 19:02:41,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:02:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67939 states. [2019-12-07 19:02:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67939 to 51075. [2019-12-07 19:02:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51075 states. [2019-12-07 19:02:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51075 states to 51075 states and 167119 transitions. [2019-12-07 19:02:42,250 INFO L78 Accepts]: Start accepts. Automaton has 51075 states and 167119 transitions. Word has length 22 [2019-12-07 19:02:42,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:42,250 INFO L462 AbstractCegarLoop]: Abstraction has 51075 states and 167119 transitions. [2019-12-07 19:02:42,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:02:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 51075 states and 167119 transitions. [2019-12-07 19:02:42,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 19:02:42,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:42,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:42,261 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:42,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1117346120, now seen corresponding path program 1 times [2019-12-07 19:02:42,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:42,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924424575] [2019-12-07 19:02:42,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:42,310 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 19:02:42,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924424575] [2019-12-07 19:02:42,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:42,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:02:42,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553168594] [2019-12-07 19:02:42,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:02:42,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:42,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:02:42,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:02:42,311 INFO L87 Difference]: Start difference. First operand 51075 states and 167119 transitions. Second operand 6 states. [2019-12-07 19:02:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:42,939 INFO L93 Difference]: Finished difference Result 75038 states and 239298 transitions. [2019-12-07 19:02:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:02:42,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 19:02:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:43,047 INFO L225 Difference]: With dead ends: 75038 [2019-12-07 19:02:43,047 INFO L226 Difference]: Without dead ends: 74924 [2019-12-07 19:02:43,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:02:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74924 states. [2019-12-07 19:02:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74924 to 55248. [2019-12-07 19:02:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55248 states. [2019-12-07 19:02:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55248 states to 55248 states and 178792 transitions. [2019-12-07 19:02:45,029 INFO L78 Accepts]: Start accepts. Automaton has 55248 states and 178792 transitions. Word has length 22 [2019-12-07 19:02:45,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:45,029 INFO L462 AbstractCegarLoop]: Abstraction has 55248 states and 178792 transitions. [2019-12-07 19:02:45,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:02:45,029 INFO L276 IsEmpty]: Start isEmpty. Operand 55248 states and 178792 transitions. [2019-12-07 19:02:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 19:02:45,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:45,048 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] [2019-12-07 19:02:45,048 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:45,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1691433742, now seen corresponding path program 1 times [2019-12-07 19:02:45,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:45,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293552566] [2019-12-07 19:02:45,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:45,099 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 19:02:45,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293552566] [2019-12-07 19:02:45,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:45,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:45,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084999951] [2019-12-07 19:02:45,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:02:45,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:45,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:02:45,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:45,100 INFO L87 Difference]: Start difference. First operand 55248 states and 178792 transitions. Second operand 5 states. [2019-12-07 19:02:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:45,517 INFO L93 Difference]: Finished difference Result 74024 states and 236084 transitions. [2019-12-07 19:02:45,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:02:45,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 19:02:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:45,629 INFO L225 Difference]: With dead ends: 74024 [2019-12-07 19:02:45,629 INFO L226 Difference]: Without dead ends: 73999 [2019-12-07 19:02:45,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 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 19:02:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73999 states. [2019-12-07 19:02:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73999 to 65282. [2019-12-07 19:02:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65282 states. [2019-12-07 19:02:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65282 states to 65282 states and 209652 transitions. [2019-12-07 19:02:46,753 INFO L78 Accepts]: Start accepts. Automaton has 65282 states and 209652 transitions. Word has length 25 [2019-12-07 19:02:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:46,753 INFO L462 AbstractCegarLoop]: Abstraction has 65282 states and 209652 transitions. [2019-12-07 19:02:46,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:02:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 65282 states and 209652 transitions. [2019-12-07 19:02:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 19:02:46,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:46,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:46,778 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:46,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1769481889, now seen corresponding path program 1 times [2019-12-07 19:02:46,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:46,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208118034] [2019-12-07 19:02:46,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:46,819 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 19:02:46,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208118034] [2019-12-07 19:02:46,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:46,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:02:46,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15727905] [2019-12-07 19:02:46,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:02:46,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:46,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:02:46,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:02:46,821 INFO L87 Difference]: Start difference. First operand 65282 states and 209652 transitions. Second operand 6 states. [2019-12-07 19:02:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:47,518 INFO L93 Difference]: Finished difference Result 85200 states and 270589 transitions. [2019-12-07 19:02:47,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:02:47,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 19:02:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:47,635 INFO L225 Difference]: With dead ends: 85200 [2019-12-07 19:02:47,636 INFO L226 Difference]: Without dead ends: 85028 [2019-12-07 19:02:47,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:02:47,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85028 states. [2019-12-07 19:02:48,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85028 to 67549. [2019-12-07 19:02:48,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67549 states. [2019-12-07 19:02:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67549 states to 67549 states and 216505 transitions. [2019-12-07 19:02:48,790 INFO L78 Accepts]: Start accepts. Automaton has 67549 states and 216505 transitions. Word has length 28 [2019-12-07 19:02:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:48,790 INFO L462 AbstractCegarLoop]: Abstraction has 67549 states and 216505 transitions. [2019-12-07 19:02:48,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:02:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 67549 states and 216505 transitions. [2019-12-07 19:02:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:02:48,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:48,818 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 19:02:48,818 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:48,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1394476543, now seen corresponding path program 1 times [2019-12-07 19:02:48,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:48,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560166009] [2019-12-07 19:02:48,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:48,859 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 19:02:48,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560166009] [2019-12-07 19:02:48,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:48,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:48,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635225653] [2019-12-07 19:02:48,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:48,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:48,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:48,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:48,860 INFO L87 Difference]: Start difference. First operand 67549 states and 216505 transitions. Second operand 4 states. [2019-12-07 19:02:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:48,937 INFO L93 Difference]: Finished difference Result 25618 states and 78096 transitions. [2019-12-07 19:02:48,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:02:48,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 19:02:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:48,967 INFO L225 Difference]: With dead ends: 25618 [2019-12-07 19:02:48,967 INFO L226 Difference]: Without dead ends: 25594 [2019-12-07 19:02:48,968 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 19:02:49,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25594 states. [2019-12-07 19:02:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25594 to 22348. [2019-12-07 19:02:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22348 states. [2019-12-07 19:02:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22348 states to 22348 states and 67876 transitions. [2019-12-07 19:02:49,277 INFO L78 Accepts]: Start accepts. Automaton has 22348 states and 67876 transitions. Word has length 30 [2019-12-07 19:02:49,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:49,278 INFO L462 AbstractCegarLoop]: Abstraction has 22348 states and 67876 transitions. [2019-12-07 19:02:49,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 22348 states and 67876 transitions. [2019-12-07 19:02:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 19:02:49,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:49,297 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] [2019-12-07 19:02:49,297 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1169825091, now seen corresponding path program 1 times [2019-12-07 19:02:49,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:49,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350076204] [2019-12-07 19:02:49,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:49,341 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 19:02:49,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350076204] [2019-12-07 19:02:49,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:49,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:02:49,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494296778] [2019-12-07 19:02:49,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:02:49,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:02:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:49,342 INFO L87 Difference]: Start difference. First operand 22348 states and 67876 transitions. Second operand 5 states. [2019-12-07 19:02:49,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:49,415 INFO L93 Difference]: Finished difference Result 20051 states and 62527 transitions. [2019-12-07 19:02:49,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:02:49,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 19:02:49,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:49,437 INFO L225 Difference]: With dead ends: 20051 [2019-12-07 19:02:49,437 INFO L226 Difference]: Without dead ends: 19599 [2019-12-07 19:02:49,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:49,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19599 states. [2019-12-07 19:02:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19599 to 11256. [2019-12-07 19:02:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11256 states. [2019-12-07 19:02:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11256 states to 11256 states and 35149 transitions. [2019-12-07 19:02:49,658 INFO L78 Accepts]: Start accepts. Automaton has 11256 states and 35149 transitions. Word has length 40 [2019-12-07 19:02:49,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:49,659 INFO L462 AbstractCegarLoop]: Abstraction has 11256 states and 35149 transitions. [2019-12-07 19:02:49,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:02:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 11256 states and 35149 transitions. [2019-12-07 19:02:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:02:49,669 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:49,670 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] [2019-12-07 19:02:49,670 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:49,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:49,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1522477301, now seen corresponding path program 1 times [2019-12-07 19:02:49,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:49,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340979155] [2019-12-07 19:02:49,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:49,712 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 19:02:49,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340979155] [2019-12-07 19:02:49,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:49,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:49,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890379649] [2019-12-07 19:02:49,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:49,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:49,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:49,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:49,713 INFO L87 Difference]: Start difference. First operand 11256 states and 35149 transitions. Second operand 3 states. [2019-12-07 19:02:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:49,769 INFO L93 Difference]: Finished difference Result 14783 states and 45372 transitions. [2019-12-07 19:02:49,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:49,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 19:02:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:49,784 INFO L225 Difference]: With dead ends: 14783 [2019-12-07 19:02:49,784 INFO L226 Difference]: Without dead ends: 14783 [2019-12-07 19:02:49,785 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 19:02:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14783 states. [2019-12-07 19:02:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14783 to 11442. [2019-12-07 19:02:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11442 states. [2019-12-07 19:02:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11442 states to 11442 states and 35872 transitions. [2019-12-07 19:02:49,964 INFO L78 Accepts]: Start accepts. Automaton has 11442 states and 35872 transitions. Word has length 55 [2019-12-07 19:02:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:49,965 INFO L462 AbstractCegarLoop]: Abstraction has 11442 states and 35872 transitions. [2019-12-07 19:02:49,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 11442 states and 35872 transitions. [2019-12-07 19:02:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 19:02:49,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:49,974 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:49,974 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:49,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1759943469, now seen corresponding path program 1 times [2019-12-07 19:02:49,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:49,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502275714] [2019-12-07 19:02:49,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:50,023 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 19:02:50,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502275714] [2019-12-07 19:02:50,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:50,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:02:50,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535952174] [2019-12-07 19:02:50,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:50,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:50,024 INFO L87 Difference]: Start difference. First operand 11442 states and 35872 transitions. Second operand 3 states. [2019-12-07 19:02:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:50,056 INFO L93 Difference]: Finished difference Result 10920 states and 33716 transitions. [2019-12-07 19:02:50,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:50,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 19:02:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:50,067 INFO L225 Difference]: With dead ends: 10920 [2019-12-07 19:02:50,067 INFO L226 Difference]: Without dead ends: 10920 [2019-12-07 19:02:50,068 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 19:02:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10920 states. [2019-12-07 19:02:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10920 to 10640. [2019-12-07 19:02:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10640 states. [2019-12-07 19:02:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10640 states to 10640 states and 32934 transitions. [2019-12-07 19:02:50,212 INFO L78 Accepts]: Start accepts. Automaton has 10640 states and 32934 transitions. Word has length 55 [2019-12-07 19:02:50,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:50,213 INFO L462 AbstractCegarLoop]: Abstraction has 10640 states and 32934 transitions. [2019-12-07 19:02:50,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 10640 states and 32934 transitions. [2019-12-07 19:02:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:02:50,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:50,221 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] [2019-12-07 19:02:50,222 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1645756632, now seen corresponding path program 1 times [2019-12-07 19:02:50,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:50,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135649247] [2019-12-07 19:02:50,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:50,273 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 19:02:50,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135649247] [2019-12-07 19:02:50,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:50,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:02:50,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011576863] [2019-12-07 19:02:50,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:02:50,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:50,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:02:50,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:02:50,274 INFO L87 Difference]: Start difference. First operand 10640 states and 32934 transitions. Second operand 6 states. [2019-12-07 19:02:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:50,543 INFO L93 Difference]: Finished difference Result 30449 states and 93332 transitions. [2019-12-07 19:02:50,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:02:50,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 19:02:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:50,567 INFO L225 Difference]: With dead ends: 30449 [2019-12-07 19:02:50,567 INFO L226 Difference]: Without dead ends: 23013 [2019-12-07 19:02:50,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:02:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23013 states. [2019-12-07 19:02:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23013 to 13804. [2019-12-07 19:02:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13804 states. [2019-12-07 19:02:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13804 states to 13804 states and 42799 transitions. [2019-12-07 19:02:50,814 INFO L78 Accepts]: Start accepts. Automaton has 13804 states and 42799 transitions. Word has length 56 [2019-12-07 19:02:50,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:50,815 INFO L462 AbstractCegarLoop]: Abstraction has 13804 states and 42799 transitions. [2019-12-07 19:02:50,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:02:50,815 INFO L276 IsEmpty]: Start isEmpty. Operand 13804 states and 42799 transitions. [2019-12-07 19:02:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:02:50,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:50,826 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] [2019-12-07 19:02:50,826 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:50,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2046427888, now seen corresponding path program 2 times [2019-12-07 19:02:50,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:50,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383251417] [2019-12-07 19:02:50,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:50,885 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 19:02:50,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383251417] [2019-12-07 19:02:50,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:50,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:02:50,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552142233] [2019-12-07 19:02:50,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:02:50,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:02:50,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:02:50,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:02:50,886 INFO L87 Difference]: Start difference. First operand 13804 states and 42799 transitions. Second operand 4 states. [2019-12-07 19:02:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:50,987 INFO L93 Difference]: Finished difference Result 34576 states and 106968 transitions. [2019-12-07 19:02:50,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:02:50,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 19:02:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:51,007 INFO L225 Difference]: With dead ends: 34576 [2019-12-07 19:02:51,007 INFO L226 Difference]: Without dead ends: 19268 [2019-12-07 19:02:51,007 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 19:02:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-07 19:02:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 11247. [2019-12-07 19:02:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11247 states. [2019-12-07 19:02:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11247 states to 11247 states and 34599 transitions. [2019-12-07 19:02:51,207 INFO L78 Accepts]: Start accepts. Automaton has 11247 states and 34599 transitions. Word has length 56 [2019-12-07 19:02:51,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:51,208 INFO L462 AbstractCegarLoop]: Abstraction has 11247 states and 34599 transitions. [2019-12-07 19:02:51,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:02:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 11247 states and 34599 transitions. [2019-12-07 19:02:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 19:02:51,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:51,217 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] [2019-12-07 19:02:51,217 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:02:51,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:51,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1377038518, now seen corresponding path program 3 times [2019-12-07 19:02:51,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:02:51,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426449930] [2019-12-07 19:02:51,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:02:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:02:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:02:51,312 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 19:02:51,312 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:02:51,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2519~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2519~0.base_30|) |v_ULTIMATE.start_main_~#t2519~0.offset_17| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_19 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2519~0.base_30|) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2519~0.base_30| 4)) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= 0 |v_ULTIMATE.start_main_~#t2519~0.offset_17|) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2519~0.base_30|) 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$r_buff1_thd1~0_390 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t2519~0.base_30| 1)) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_~#t2519~0.base=|v_ULTIMATE.start_main_~#t2519~0.base_30|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ULTIMATE.start_main_~#t2519~0.offset=|v_ULTIMATE.start_main_~#t2519~0.offset_17|, ULTIMATE.start_main_~#t2521~0.base=|v_ULTIMATE.start_main_~#t2521~0.base_24|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2520~0.base=|v_ULTIMATE.start_main_~#t2520~0.base_24|, ULTIMATE.start_main_~#t2521~0.offset=|v_ULTIMATE.start_main_~#t2521~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ULTIMATE.start_main_~#t2520~0.offset=|v_ULTIMATE.start_main_~#t2520~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2519~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2519~0.offset, ULTIMATE.start_main_~#t2521~0.base, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2520~0.base, ULTIMATE.start_main_~#t2521~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2520~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:02:51,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2520~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2520~0.base_13|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2520~0.base_13| 1)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2520~0.base_13|)) (= |v_ULTIMATE.start_main_~#t2520~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2520~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2520~0.base_13|) |v_ULTIMATE.start_main_~#t2520~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t2520~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2520~0.offset=|v_ULTIMATE.start_main_~#t2520~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2520~0.base=|v_ULTIMATE.start_main_~#t2520~0.base_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2520~0.offset, ULTIMATE.start_main_~#t2520~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 19:02:51,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (= 1 v_~y~0_6) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 19:02:51,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2521~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2521~0.base_13|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2521~0.base_13|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2521~0.base_13| 1) |v_#valid_32|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2521~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2521~0.base_13|) |v_ULTIMATE.start_main_~#t2521~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2521~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2521~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2521~0.offset=|v_ULTIMATE.start_main_~#t2521~0.offset_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2521~0.base=|v_ULTIMATE.start_main_~#t2521~0.base_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2521~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2521~0.base, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 19:02:51,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-896808271 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-896808271 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-896808271| ~x$w_buff1~0_In-896808271) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-896808271 |P2Thread1of1ForFork1_#t~ite32_Out-896808271|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-896808271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-896808271, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-896808271, ~x~0=~x~0_In-896808271} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-896808271|, ~x$w_buff1~0=~x$w_buff1~0_In-896808271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-896808271, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-896808271, ~x~0=~x~0_In-896808271} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:02:51,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:02:51,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1816168862 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1816168862 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1816168862| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1816168862 |P2Thread1of1ForFork1_#t~ite34_Out-1816168862|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1816168862, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816168862} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1816168862|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1816168862, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816168862} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:02:51,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In278499480 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In278499480 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In278499480 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In278499480 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out278499480| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite35_Out278499480| ~x$w_buff1_used~0_In278499480) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In278499480, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In278499480, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In278499480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In278499480} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out278499480|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In278499480, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In278499480, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In278499480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In278499480} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:02:51,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1422999399 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1422999399 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1422999399| ~x$r_buff0_thd3~0_In-1422999399) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-1422999399| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1422999399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1422999399} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1422999399|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1422999399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1422999399} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:02:51,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In71691091 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In71691091 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In71691091 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In71691091 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out71691091|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd3~0_In71691091 |P2Thread1of1ForFork1_#t~ite37_Out71691091|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In71691091, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In71691091, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In71691091, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71691091} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out71691091|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In71691091, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In71691091, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In71691091, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71691091} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:02:51,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_34|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:02:51,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In64077952 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In64077952 256) 0))) (or (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In64077952 256))) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In64077952 256))) (= 0 (mod ~x$w_buff0_used~0_In64077952 256)))) (= |P0Thread1of1ForFork2_#t~ite12_Out64077952| |P0Thread1of1ForFork2_#t~ite11_Out64077952|) (= ~x$w_buff1~0_In64077952 |P0Thread1of1ForFork2_#t~ite11_Out64077952|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite11_In64077952| |P0Thread1of1ForFork2_#t~ite11_Out64077952|) (= ~x$w_buff1~0_In64077952 |P0Thread1of1ForFork2_#t~ite12_Out64077952|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In64077952, ~x$w_buff1~0=~x$w_buff1~0_In64077952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In64077952, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In64077952, ~weak$$choice2~0=~weak$$choice2~0_In64077952, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In64077952|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64077952} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In64077952, ~x$w_buff1~0=~x$w_buff1~0_In64077952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In64077952, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In64077952, ~weak$$choice2~0=~weak$$choice2~0_In64077952, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out64077952|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out64077952|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64077952} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 19:02:51,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In778140942 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In778140942| |P0Thread1of1ForFork2_#t~ite14_Out778140942|) (= |P0Thread1of1ForFork2_#t~ite15_Out778140942| ~x$w_buff0_used~0_In778140942)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out778140942| |P0Thread1of1ForFork2_#t~ite14_Out778140942|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In778140942 256) 0))) (or (= (mod ~x$w_buff0_used~0_In778140942 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In778140942 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In778140942 256) 0) .cse1))) .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out778140942| ~x$w_buff0_used~0_In778140942)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In778140942, ~x$w_buff1_used~0=~x$w_buff1_used~0_In778140942, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In778140942, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In778140942|, ~weak$$choice2~0=~weak$$choice2~0_In778140942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In778140942} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In778140942, ~x$w_buff1_used~0=~x$w_buff1_used~0_In778140942, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out778140942|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In778140942, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out778140942|, ~weak$$choice2~0=~weak$$choice2~0_In778140942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In778140942} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:02:51,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:02:51,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1282439239 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out1282439239| |P0Thread1of1ForFork2_#t~ite24_Out1282439239|) (= |P0Thread1of1ForFork2_#t~ite23_Out1282439239| ~x$r_buff1_thd1~0_In1282439239) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1282439239 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1282439239 256)) (and .cse0 (= (mod ~x$w_buff1_used~0_In1282439239 256) 0)) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1282439239 256))))) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite23_In1282439239| |P0Thread1of1ForFork2_#t~ite23_Out1282439239|) (= |P0Thread1of1ForFork2_#t~ite24_Out1282439239| ~x$r_buff1_thd1~0_In1282439239) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1282439239, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1282439239, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1282439239, ~weak$$choice2~0=~weak$$choice2~0_In1282439239, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1282439239|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282439239} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1282439239, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1282439239, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1282439239, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1282439239|, ~weak$$choice2~0=~weak$$choice2~0_In1282439239, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1282439239|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282439239} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 19:02:51,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:02:51,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1165063447 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1165063447 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1165063447|)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1165063447| ~x$w_buff0_used~0_In-1165063447) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1165063447, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1165063447} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1165063447, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1165063447|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1165063447} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:02:51,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1878129238 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1878129238 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1878129238 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1878129238 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1878129238|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1878129238 |P1Thread1of1ForFork0_#t~ite29_Out-1878129238|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1878129238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1878129238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1878129238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1878129238} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1878129238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1878129238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1878129238, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1878129238|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1878129238} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:02:51,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In540860393 256))) (.cse0 (= ~x$r_buff0_thd2~0_In540860393 ~x$r_buff0_thd2~0_Out540860393)) (.cse2 (= (mod ~x$w_buff0_used~0_In540860393 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (= ~x$r_buff0_thd2~0_Out540860393 0) (not .cse1)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In540860393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540860393} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out540860393|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out540860393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540860393} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:02:51,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-607280704 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-607280704 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-607280704 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-607280704 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-607280704| ~x$r_buff1_thd2~0_In-607280704) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-607280704|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-607280704, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-607280704, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-607280704, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-607280704} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-607280704|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-607280704, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-607280704, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-607280704, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-607280704} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:02:51,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:02:51,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_29) 1 0)) 0 1) v_~main$tmp_guard0~0_7) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:02:51,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In714168910 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In714168910 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite42_Out714168910| |ULTIMATE.start_main_#t~ite41_Out714168910|))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out714168910| ~x$w_buff1~0_In714168910) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~x~0_In714168910 |ULTIMATE.start_main_#t~ite41_Out714168910|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In714168910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In714168910, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In714168910, ~x~0=~x~0_In714168910} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out714168910|, ~x$w_buff1~0=~x$w_buff1~0_In714168910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In714168910, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In714168910, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out714168910|, ~x~0=~x~0_In714168910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 19:02:51,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1119925116 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1119925116 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1119925116| ~x$w_buff0_used~0_In1119925116)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1119925116| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1119925116, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1119925116} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1119925116, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1119925116|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1119925116} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:02:51,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In547237781 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In547237781 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In547237781 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In547237781 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out547237781| ~x$w_buff1_used~0_In547237781) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out547237781| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In547237781, ~x$w_buff1_used~0=~x$w_buff1_used~0_In547237781, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In547237781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In547237781} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In547237781, ~x$w_buff1_used~0=~x$w_buff1_used~0_In547237781, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In547237781, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out547237781|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In547237781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:02:51,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-646028090 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-646028090 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-646028090| ~x$r_buff0_thd0~0_In-646028090) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out-646028090| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-646028090, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-646028090} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-646028090, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-646028090|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-646028090} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:02:51,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-581216779 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-581216779 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-581216779 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-581216779 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-581216779|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-581216779 |ULTIMATE.start_main_#t~ite46_Out-581216779|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-581216779, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-581216779, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-581216779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-581216779} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-581216779, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-581216779|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-581216779, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-581216779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-581216779} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:02:51,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= (ite (= (ite (not (and (= v_~z~0_43 2) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:02:51,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:02:51 BasicIcfg [2019-12-07 19:02:51,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:02:51,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:02:51,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:02:51,386 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:02:51,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:34" (3/4) ... [2019-12-07 19:02:51,388 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:02:51,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2519~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2519~0.base_30|) |v_ULTIMATE.start_main_~#t2519~0.offset_17| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_19 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2519~0.base_30|) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2519~0.base_30| 4)) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= 0 |v_ULTIMATE.start_main_~#t2519~0.offset_17|) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2519~0.base_30|) 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$r_buff1_thd1~0_390 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t2519~0.base_30| 1)) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_~#t2519~0.base=|v_ULTIMATE.start_main_~#t2519~0.base_30|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ULTIMATE.start_main_~#t2519~0.offset=|v_ULTIMATE.start_main_~#t2519~0.offset_17|, ULTIMATE.start_main_~#t2521~0.base=|v_ULTIMATE.start_main_~#t2521~0.base_24|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2520~0.base=|v_ULTIMATE.start_main_~#t2520~0.base_24|, ULTIMATE.start_main_~#t2521~0.offset=|v_ULTIMATE.start_main_~#t2521~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ULTIMATE.start_main_~#t2520~0.offset=|v_ULTIMATE.start_main_~#t2520~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2519~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2519~0.offset, ULTIMATE.start_main_~#t2521~0.base, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2520~0.base, ULTIMATE.start_main_~#t2521~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2520~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:02:51,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2520~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2520~0.base_13|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2520~0.base_13| 1)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2520~0.base_13|)) (= |v_ULTIMATE.start_main_~#t2520~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2520~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2520~0.base_13|) |v_ULTIMATE.start_main_~#t2520~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t2520~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2520~0.offset=|v_ULTIMATE.start_main_~#t2520~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2520~0.base=|v_ULTIMATE.start_main_~#t2520~0.base_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2520~0.offset, ULTIMATE.start_main_~#t2520~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 19:02:51,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (= 1 v_~y~0_6) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 19:02:51,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2521~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2521~0.base_13|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2521~0.base_13|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2521~0.base_13| 1) |v_#valid_32|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2521~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2521~0.base_13|) |v_ULTIMATE.start_main_~#t2521~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2521~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2521~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2521~0.offset=|v_ULTIMATE.start_main_~#t2521~0.offset_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2521~0.base=|v_ULTIMATE.start_main_~#t2521~0.base_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2521~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2521~0.base, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 19:02:51,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-896808271 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-896808271 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-896808271| ~x$w_buff1~0_In-896808271) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In-896808271 |P2Thread1of1ForFork1_#t~ite32_Out-896808271|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-896808271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-896808271, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-896808271, ~x~0=~x~0_In-896808271} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-896808271|, ~x$w_buff1~0=~x$w_buff1~0_In-896808271, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-896808271, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-896808271, ~x~0=~x~0_In-896808271} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 19:02:51,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 19:02:51,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1816168862 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1816168862 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1816168862| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1816168862 |P2Thread1of1ForFork1_#t~ite34_Out-1816168862|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1816168862, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816168862} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1816168862|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1816168862, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1816168862} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 19:02:51,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In278499480 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In278499480 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In278499480 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In278499480 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out278499480| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite35_Out278499480| ~x$w_buff1_used~0_In278499480) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In278499480, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In278499480, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In278499480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In278499480} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out278499480|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In278499480, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In278499480, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In278499480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In278499480} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 19:02:51,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1422999399 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1422999399 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1422999399| ~x$r_buff0_thd3~0_In-1422999399) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-1422999399| 0) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1422999399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1422999399} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1422999399|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1422999399, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1422999399} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 19:02:51,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In71691091 256))) (.cse2 (= (mod ~x$r_buff0_thd3~0_In71691091 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In71691091 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In71691091 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out71691091|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd3~0_In71691091 |P2Thread1of1ForFork1_#t~ite37_Out71691091|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In71691091, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In71691091, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In71691091, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71691091} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out71691091|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In71691091, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In71691091, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In71691091, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71691091} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 19:02:51,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_34|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 19:02:51,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In64077952 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In64077952 256) 0))) (or (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In64077952 256))) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In64077952 256))) (= 0 (mod ~x$w_buff0_used~0_In64077952 256)))) (= |P0Thread1of1ForFork2_#t~ite12_Out64077952| |P0Thread1of1ForFork2_#t~ite11_Out64077952|) (= ~x$w_buff1~0_In64077952 |P0Thread1of1ForFork2_#t~ite11_Out64077952|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite11_In64077952| |P0Thread1of1ForFork2_#t~ite11_Out64077952|) (= ~x$w_buff1~0_In64077952 |P0Thread1of1ForFork2_#t~ite12_Out64077952|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In64077952, ~x$w_buff1~0=~x$w_buff1~0_In64077952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In64077952, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In64077952, ~weak$$choice2~0=~weak$$choice2~0_In64077952, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In64077952|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64077952} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In64077952, ~x$w_buff1~0=~x$w_buff1~0_In64077952, ~x$w_buff1_used~0=~x$w_buff1_used~0_In64077952, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In64077952, ~weak$$choice2~0=~weak$$choice2~0_In64077952, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out64077952|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out64077952|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64077952} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 19:02:51,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In778140942 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In778140942| |P0Thread1of1ForFork2_#t~ite14_Out778140942|) (= |P0Thread1of1ForFork2_#t~ite15_Out778140942| ~x$w_buff0_used~0_In778140942)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out778140942| |P0Thread1of1ForFork2_#t~ite14_Out778140942|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In778140942 256) 0))) (or (= (mod ~x$w_buff0_used~0_In778140942 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In778140942 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In778140942 256) 0) .cse1))) .cse0 (= |P0Thread1of1ForFork2_#t~ite14_Out778140942| ~x$w_buff0_used~0_In778140942)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In778140942, ~x$w_buff1_used~0=~x$w_buff1_used~0_In778140942, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In778140942, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In778140942|, ~weak$$choice2~0=~weak$$choice2~0_In778140942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In778140942} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In778140942, ~x$w_buff1_used~0=~x$w_buff1_used~0_In778140942, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out778140942|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In778140942, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out778140942|, ~weak$$choice2~0=~weak$$choice2~0_In778140942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In778140942} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 19:02:51,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 19:02:51,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1282439239 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out1282439239| |P0Thread1of1ForFork2_#t~ite24_Out1282439239|) (= |P0Thread1of1ForFork2_#t~ite23_Out1282439239| ~x$r_buff1_thd1~0_In1282439239) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1282439239 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1282439239 256)) (and .cse0 (= (mod ~x$w_buff1_used~0_In1282439239 256) 0)) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In1282439239 256))))) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite23_In1282439239| |P0Thread1of1ForFork2_#t~ite23_Out1282439239|) (= |P0Thread1of1ForFork2_#t~ite24_Out1282439239| ~x$r_buff1_thd1~0_In1282439239) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1282439239, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1282439239, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1282439239, ~weak$$choice2~0=~weak$$choice2~0_In1282439239, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1282439239|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282439239} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1282439239, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1282439239, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1282439239, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1282439239|, ~weak$$choice2~0=~weak$$choice2~0_In1282439239, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1282439239|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1282439239} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 19:02:51,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 19:02:51,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1165063447 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1165063447 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1165063447|)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1165063447| ~x$w_buff0_used~0_In-1165063447) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1165063447, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1165063447} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1165063447, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1165063447|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1165063447} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 19:02:51,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1878129238 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1878129238 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1878129238 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1878129238 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1878129238|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1878129238 |P1Thread1of1ForFork0_#t~ite29_Out-1878129238|) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1878129238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1878129238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1878129238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1878129238} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1878129238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1878129238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1878129238, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1878129238|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1878129238} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 19:02:51,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In540860393 256))) (.cse0 (= ~x$r_buff0_thd2~0_In540860393 ~x$r_buff0_thd2~0_Out540860393)) (.cse2 (= (mod ~x$w_buff0_used~0_In540860393 256) 0))) (or (and .cse0 .cse1) (and (not .cse2) (= ~x$r_buff0_thd2~0_Out540860393 0) (not .cse1)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In540860393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540860393} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out540860393|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out540860393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In540860393} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 19:02:51,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-607280704 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-607280704 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-607280704 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-607280704 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-607280704| ~x$r_buff1_thd2~0_In-607280704) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-607280704|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-607280704, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-607280704, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-607280704, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-607280704} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-607280704|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-607280704, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-607280704, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-607280704, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-607280704} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 19:02:51,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:02:51,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_29) 1 0)) 0 1) v_~main$tmp_guard0~0_7) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:02:51,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In714168910 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In714168910 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite42_Out714168910| |ULTIMATE.start_main_#t~ite41_Out714168910|))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out714168910| ~x$w_buff1~0_In714168910) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= ~x~0_In714168910 |ULTIMATE.start_main_#t~ite41_Out714168910|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In714168910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In714168910, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In714168910, ~x~0=~x~0_In714168910} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out714168910|, ~x$w_buff1~0=~x$w_buff1~0_In714168910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In714168910, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In714168910, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out714168910|, ~x~0=~x~0_In714168910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 19:02:51,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1119925116 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1119925116 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1119925116| ~x$w_buff0_used~0_In1119925116)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1119925116| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1119925116, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1119925116} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1119925116, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1119925116|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1119925116} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 19:02:51,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In547237781 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In547237781 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In547237781 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In547237781 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out547237781| ~x$w_buff1_used~0_In547237781) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out547237781| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In547237781, ~x$w_buff1_used~0=~x$w_buff1_used~0_In547237781, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In547237781, ~x$w_buff0_used~0=~x$w_buff0_used~0_In547237781} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In547237781, ~x$w_buff1_used~0=~x$w_buff1_used~0_In547237781, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In547237781, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out547237781|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In547237781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 19:02:51,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-646028090 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-646028090 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-646028090| ~x$r_buff0_thd0~0_In-646028090) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out-646028090| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-646028090, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-646028090} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-646028090, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-646028090|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-646028090} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 19:02:51,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-581216779 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-581216779 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-581216779 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-581216779 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-581216779|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In-581216779 |ULTIMATE.start_main_#t~ite46_Out-581216779|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-581216779, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-581216779, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-581216779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-581216779} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-581216779, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-581216779|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-581216779, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-581216779, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-581216779} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 19:02:51,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= (ite (= (ite (not (and (= v_~z~0_43 2) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:02:51,469 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e9c945fd-fd31-4e18-ace8-9416020fda48/bin/uautomizer/witness.graphml [2019-12-07 19:02:51,469 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:02:51,471 INFO L168 Benchmark]: Toolchain (without parser) took 77900.11 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 942.3 MB in the beginning and 4.9 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 19:02:51,471 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:02:51,471 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -124.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:51,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:51,472 INFO L168 Benchmark]: Boogie Preprocessor took 23.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:02:51,472 INFO L168 Benchmark]: RCFGBuilder took 393.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:51,473 INFO L168 Benchmark]: TraceAbstraction took 76954.75 ms. Allocated memory was 1.1 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 19:02:51,473 INFO L168 Benchmark]: Witness Printer took 83.59 ms. Allocated memory is still 6.3 GB. Free memory was 5.0 GB in the beginning and 4.9 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:51,475 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 404.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -124.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 393.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76954.75 ms. Allocated memory was 1.1 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 83.59 ms. Allocated memory is still 6.3 GB. Free memory was 5.0 GB in the beginning and 4.9 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6611 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 125 SemBasedMoverChecksPositive, 244 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 64880 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2519, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L818] FCALL, FORK 0 pthread_create(&t2520, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2521, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 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 [!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)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 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) [L738] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] EXPR 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=2] [L738] 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)) [L739] 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)) [L740] 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)) [L741] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=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))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=2] [L741] 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)) [L743] 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)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 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 [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=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2, z=2] [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 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 76.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2689 SDtfs, 2430 SDslu, 4473 SDs, 0 SdLazy, 2311 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250613occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 50.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 174039 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 472 ConstructedInterpolants, 0 QuantifiedInterpolants, 77426 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...