./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_rmo.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_6ff2dd79-b920-400c-a728-b3a2f8d03677/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/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 696863e28c92f843bc86d83de7161e1c02efef73 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:01:08,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:01:08,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:01:08,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:01:08,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:01:08,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:01:08,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:01:08,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:01:08,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:01:08,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:01:08,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:01:08,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:01:08,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:01:08,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:01:08,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:01:08,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:01:08,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:01:08,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:01:08,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:01:08,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:01:08,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:01:08,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:01:08,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:01:08,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:01:08,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:01:08,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:01:08,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:01:08,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:01:08,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:01:08,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:01:08,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:01:08,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:01:08,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:01:08,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:01:08,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:01:08,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:01:08,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:01:08,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:01:08,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:01:08,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:01:08,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:01:08,525 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:01:08,537 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:01:08,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:01:08,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:01:08,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:01:08,539 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:01:08,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:01:08,539 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:01:08,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:01:08,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:01:08,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:01:08,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:01:08,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:01:08,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:01:08,540 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:01:08,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:01:08,541 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:01:08,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:01:08,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:01:08,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:01:08,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:01:08,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:01:08,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:01:08,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:01:08,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:01:08,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:01:08,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:01:08,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:01:08,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:01:08,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:01:08,543 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_6ff2dd79-b920-400c-a728-b3a2f8d03677/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 -> 696863e28c92f843bc86d83de7161e1c02efef73 [2019-12-07 13:01:08,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:01:08,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:01:08,653 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:01:08,654 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:01:08,654 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:01:08,655 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix035_rmo.oepc.i [2019-12-07 13:01:08,697 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/bin/uautomizer/data/dbb2c8944/600744a645264fa7ab2853ad938d712b/FLAGb960fed25 [2019-12-07 13:01:09,074 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:01:09,075 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/sv-benchmarks/c/pthread-wmm/mix035_rmo.oepc.i [2019-12-07 13:01:09,086 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/bin/uautomizer/data/dbb2c8944/600744a645264fa7ab2853ad938d712b/FLAGb960fed25 [2019-12-07 13:01:09,095 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/bin/uautomizer/data/dbb2c8944/600744a645264fa7ab2853ad938d712b [2019-12-07 13:01:09,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:01:09,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:01:09,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:01:09,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:01:09,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:01:09,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:01:09" (1/1) ... [2019-12-07 13:01:09,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09, skipping insertion in model container [2019-12-07 13:01:09,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:01:09" (1/1) ... [2019-12-07 13:01:09,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:01:09,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:01:09,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:01:09,393 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:01:09,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:01:09,490 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:01:09,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09 WrapperNode [2019-12-07 13:01:09,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:01:09,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:01:09,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:01:09,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:01:09,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09" (1/1) ... [2019-12-07 13:01:09,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09" (1/1) ... [2019-12-07 13:01:09,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:01:09,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:01:09,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:01:09,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:01:09,535 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09" (1/1) ... [2019-12-07 13:01:09,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09" (1/1) ... [2019-12-07 13:01:09,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09" (1/1) ... [2019-12-07 13:01:09,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09" (1/1) ... [2019-12-07 13:01:09,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09" (1/1) ... [2019-12-07 13:01:09,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09" (1/1) ... [2019-12-07 13:01:09,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09" (1/1) ... [2019-12-07 13:01:09,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:01:09,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:01:09,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:01:09,555 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:01:09,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/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 13:01:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:01:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:01:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:01:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:01:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:01:09,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:01:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:01:09,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:01:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:01:09,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:01:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:01:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:01:09,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:01:09,606 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 13:01:09,966 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:01:09,966 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:01:09,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:01:09 BoogieIcfgContainer [2019-12-07 13:01:09,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:01:09,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:01:09,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:01:09,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:01:09,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:01:09" (1/3) ... [2019-12-07 13:01:09,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f662600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:01:09, skipping insertion in model container [2019-12-07 13:01:09,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:01:09" (2/3) ... [2019-12-07 13:01:09,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f662600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:01:09, skipping insertion in model container [2019-12-07 13:01:09,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:01:09" (3/3) ... [2019-12-07 13:01:09,971 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_rmo.oepc.i [2019-12-07 13:01:09,978 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:01:09,978 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:01:09,983 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:01:09,983 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:01:10,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,010 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,010 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,018 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,018 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,029 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:01:10,040 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:01:10,052 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:01:10,052 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:01:10,052 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:01:10,052 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:01:10,052 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:01:10,053 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:01:10,053 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:01:10,053 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:01:10,064 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-07 13:01:10,065 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-07 13:01:10,121 INFO L134 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-07 13:01:10,121 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:01:10,131 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 707 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 13:01:10,145 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-07 13:01:10,179 INFO L134 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-07 13:01:10,179 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:01:10,184 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 707 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 13:01:10,200 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 13:01:10,200 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:01:13,167 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 13:01:13,382 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 13:01:13,422 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-07 13:01:13,422 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-07 13:01:13,424 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-07 13:01:28,017 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-07 13:01:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-07 13:01:28,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:01:28,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:28,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:01:28,022 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:28,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:28,026 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-07 13:01:28,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:28,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502461185] [2019-12-07 13:01:28,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:28,171 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 13:01:28,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502461185] [2019-12-07 13:01:28,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:28,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:01:28,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106741107] [2019-12-07 13:01:28,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:01:28,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:28,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:01:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:28,190 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-07 13:01:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:28,880 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-07 13:01:28,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:01:28,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:01:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:29,524 INFO L225 Difference]: With dead ends: 117122 [2019-12-07 13:01:29,524 INFO L226 Difference]: Without dead ends: 109842 [2019-12-07 13:01:29,525 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 13:01:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-07 13:01:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-07 13:01:35,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-07 13:01:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-07 13:01:37,318 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-07 13:01:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:37,319 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-07 13:01:37,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:01:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-07 13:01:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:01:37,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:37,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:37,324 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:37,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:37,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-07 13:01:37,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:37,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660745435] [2019-12-07 13:01:37,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:37,409 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 13:01:37,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660745435] [2019-12-07 13:01:37,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:37,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:01:37,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193844261] [2019-12-07 13:01:37,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:01:37,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:01:37,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:01:37,411 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-07 13:01:38,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:38,282 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-07 13:01:38,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:01:38,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:01:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:38,718 INFO L225 Difference]: With dead ends: 170700 [2019-12-07 13:01:38,718 INFO L226 Difference]: Without dead ends: 170651 [2019-12-07 13:01:38,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:01:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-07 13:01:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-07 13:01:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-07 13:01:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-07 13:01:47,123 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-07 13:01:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:47,123 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-07 13:01:47,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:01:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-07 13:01:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:01:47,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:47,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:47,127 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:47,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:47,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-07 13:01:47,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:47,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761439681] [2019-12-07 13:01:47,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:47,173 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 13:01:47,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761439681] [2019-12-07 13:01:47,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:47,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:01:47,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230442117] [2019-12-07 13:01:47,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:01:47,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:47,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:01:47,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:47,175 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 3 states. [2019-12-07 13:01:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:47,280 INFO L93 Difference]: Finished difference Result 33806 states and 110729 transitions. [2019-12-07 13:01:47,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:01:47,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 13:01:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:47,353 INFO L225 Difference]: With dead ends: 33806 [2019-12-07 13:01:47,353 INFO L226 Difference]: Without dead ends: 33806 [2019-12-07 13:01:47,353 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 13:01:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33806 states. [2019-12-07 13:01:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33806 to 33806. [2019-12-07 13:01:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33806 states. [2019-12-07 13:01:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33806 states to 33806 states and 110729 transitions. [2019-12-07 13:01:49,472 INFO L78 Accepts]: Start accepts. Automaton has 33806 states and 110729 transitions. Word has length 13 [2019-12-07 13:01:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:49,472 INFO L462 AbstractCegarLoop]: Abstraction has 33806 states and 110729 transitions. [2019-12-07 13:01:49,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:01:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 33806 states and 110729 transitions. [2019-12-07 13:01:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:01:49,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:49,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:49,475 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:49,475 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-07 13:01:49,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:49,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110004142] [2019-12-07 13:01:49,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:49,501 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 13:01:49,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110004142] [2019-12-07 13:01:49,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:49,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:01:49,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467522123] [2019-12-07 13:01:49,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:01:49,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:49,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:01:49,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:49,502 INFO L87 Difference]: Start difference. First operand 33806 states and 110729 transitions. Second operand 3 states. [2019-12-07 13:01:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:49,671 INFO L93 Difference]: Finished difference Result 52205 states and 169891 transitions. [2019-12-07 13:01:49,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:01:49,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:01:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:49,755 INFO L225 Difference]: With dead ends: 52205 [2019-12-07 13:01:49,755 INFO L226 Difference]: Without dead ends: 52205 [2019-12-07 13:01:49,755 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 13:01:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52205 states. [2019-12-07 13:01:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52205 to 38718. [2019-12-07 13:01:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38718 states. [2019-12-07 13:01:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38718 states to 38718 states and 127749 transitions. [2019-12-07 13:01:50,490 INFO L78 Accepts]: Start accepts. Automaton has 38718 states and 127749 transitions. Word has length 16 [2019-12-07 13:01:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:50,491 INFO L462 AbstractCegarLoop]: Abstraction has 38718 states and 127749 transitions. [2019-12-07 13:01:50,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:01:50,491 INFO L276 IsEmpty]: Start isEmpty. Operand 38718 states and 127749 transitions. [2019-12-07 13:01:50,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:01:50,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:50,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:50,493 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:50,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:50,494 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-07 13:01:50,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:50,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141178523] [2019-12-07 13:01:50,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:50,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141178523] [2019-12-07 13:01:50,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:50,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:01:50,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408928027] [2019-12-07 13:01:50,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:01:50,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:50,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:01:50,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:01:50,537 INFO L87 Difference]: Start difference. First operand 38718 states and 127749 transitions. Second operand 4 states. [2019-12-07 13:01:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:50,776 INFO L93 Difference]: Finished difference Result 46485 states and 150983 transitions. [2019-12-07 13:01:50,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:01:50,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:01:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:50,841 INFO L225 Difference]: With dead ends: 46485 [2019-12-07 13:01:50,841 INFO L226 Difference]: Without dead ends: 46485 [2019-12-07 13:01:50,841 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 13:01:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46485 states. [2019-12-07 13:01:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46485 to 42622. [2019-12-07 13:01:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42622 states. [2019-12-07 13:01:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42622 states to 42622 states and 139503 transitions. [2019-12-07 13:01:51,569 INFO L78 Accepts]: Start accepts. Automaton has 42622 states and 139503 transitions. Word has length 16 [2019-12-07 13:01:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:51,570 INFO L462 AbstractCegarLoop]: Abstraction has 42622 states and 139503 transitions. [2019-12-07 13:01:51,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:01:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 42622 states and 139503 transitions. [2019-12-07 13:01:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:01:51,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:51,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:51,573 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:51,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-07 13:01:51,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:51,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635690982] [2019-12-07 13:01:51,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:51,619 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 13:01:51,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635690982] [2019-12-07 13:01:51,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:51,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:01:51,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740115344] [2019-12-07 13:01:51,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:01:51,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:51,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:01:51,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:01:51,620 INFO L87 Difference]: Start difference. First operand 42622 states and 139503 transitions. Second operand 4 states. [2019-12-07 13:01:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:51,988 INFO L93 Difference]: Finished difference Result 51005 states and 165609 transitions. [2019-12-07 13:01:51,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:01:51,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:01:51,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:52,071 INFO L225 Difference]: With dead ends: 51005 [2019-12-07 13:01:52,071 INFO L226 Difference]: Without dead ends: 51005 [2019-12-07 13:01:52,072 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 13:01:52,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51005 states. [2019-12-07 13:01:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51005 to 44274. [2019-12-07 13:01:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44274 states. [2019-12-07 13:01:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44274 states to 44274 states and 144974 transitions. [2019-12-07 13:01:52,840 INFO L78 Accepts]: Start accepts. Automaton has 44274 states and 144974 transitions. Word has length 16 [2019-12-07 13:01:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:52,840 INFO L462 AbstractCegarLoop]: Abstraction has 44274 states and 144974 transitions. [2019-12-07 13:01:52,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:01:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 44274 states and 144974 transitions. [2019-12-07 13:01:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:01:52,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:52,847 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 13:01:52,847 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:52,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-07 13:01:52,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:52,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313849712] [2019-12-07 13:01:52,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:52,910 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 13:01:52,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313849712] [2019-12-07 13:01:52,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:52,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:01:52,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718169408] [2019-12-07 13:01:52,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:01:52,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:52,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:01:52,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:01:52,911 INFO L87 Difference]: Start difference. First operand 44274 states and 144974 transitions. Second operand 5 states. [2019-12-07 13:01:53,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:53,381 INFO L93 Difference]: Finished difference Result 60565 states and 193473 transitions. [2019-12-07 13:01:53,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:01:53,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 13:01:53,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:53,478 INFO L225 Difference]: With dead ends: 60565 [2019-12-07 13:01:53,478 INFO L226 Difference]: Without dead ends: 60558 [2019-12-07 13:01:53,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:01:53,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60558 states. [2019-12-07 13:01:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60558 to 45614. [2019-12-07 13:01:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45614 states. [2019-12-07 13:01:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45614 states to 45614 states and 149067 transitions. [2019-12-07 13:01:54,339 INFO L78 Accepts]: Start accepts. Automaton has 45614 states and 149067 transitions. Word has length 22 [2019-12-07 13:01:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:54,340 INFO L462 AbstractCegarLoop]: Abstraction has 45614 states and 149067 transitions. [2019-12-07 13:01:54,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:01:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 45614 states and 149067 transitions. [2019-12-07 13:01:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:01:54,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:54,345 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 13:01:54,346 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:54,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:54,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-07 13:01:54,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:54,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527166852] [2019-12-07 13:01:54,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:54,404 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 13:01:54,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527166852] [2019-12-07 13:01:54,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:54,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:01:54,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732607393] [2019-12-07 13:01:54,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:01:54,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:54,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:01:54,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:01:54,406 INFO L87 Difference]: Start difference. First operand 45614 states and 149067 transitions. Second operand 5 states. [2019-12-07 13:01:54,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:54,881 INFO L93 Difference]: Finished difference Result 63360 states and 201880 transitions. [2019-12-07 13:01:54,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:01:54,882 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 13:01:54,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:54,977 INFO L225 Difference]: With dead ends: 63360 [2019-12-07 13:01:54,977 INFO L226 Difference]: Without dead ends: 63353 [2019-12-07 13:01:54,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:01:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63353 states. [2019-12-07 13:01:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63353 to 43925. [2019-12-07 13:01:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43925 states. [2019-12-07 13:01:55,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43925 states to 43925 states and 143672 transitions. [2019-12-07 13:01:55,881 INFO L78 Accepts]: Start accepts. Automaton has 43925 states and 143672 transitions. Word has length 22 [2019-12-07 13:01:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:55,881 INFO L462 AbstractCegarLoop]: Abstraction has 43925 states and 143672 transitions. [2019-12-07 13:01:55,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:01:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 43925 states and 143672 transitions. [2019-12-07 13:01:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:01:55,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:55,891 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 13:01:55,891 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:55,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:55,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1701171988, now seen corresponding path program 1 times [2019-12-07 13:01:55,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:55,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400551583] [2019-12-07 13:01:55,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:55,929 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 13:01:55,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400551583] [2019-12-07 13:01:55,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:55,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:01:55,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610250666] [2019-12-07 13:01:55,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:01:55,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:55,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:01:55,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:01:55,930 INFO L87 Difference]: Start difference. First operand 43925 states and 143672 transitions. Second operand 4 states. [2019-12-07 13:01:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:55,990 INFO L93 Difference]: Finished difference Result 18121 states and 56197 transitions. [2019-12-07 13:01:55,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:01:55,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 13:01:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:56,012 INFO L225 Difference]: With dead ends: 18121 [2019-12-07 13:01:56,012 INFO L226 Difference]: Without dead ends: 18121 [2019-12-07 13:01:56,013 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 13:01:56,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2019-12-07 13:01:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17758. [2019-12-07 13:01:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-07 13:01:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 55161 transitions. [2019-12-07 13:01:56,275 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 55161 transitions. Word has length 25 [2019-12-07 13:01:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:56,275 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 55161 transitions. [2019-12-07 13:01:56,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:01:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 55161 transitions. [2019-12-07 13:01:56,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:01:56,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:56,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:56,287 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:56,287 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-07 13:01:56,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:56,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041439866] [2019-12-07 13:01:56,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:56,307 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 13:01:56,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041439866] [2019-12-07 13:01:56,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:56,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:01:56,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603831491] [2019-12-07 13:01:56,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:01:56,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:56,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:01:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:01:56,308 INFO L87 Difference]: Start difference. First operand 17758 states and 55161 transitions. Second operand 3 states. [2019-12-07 13:01:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:56,391 INFO L93 Difference]: Finished difference Result 23499 states and 69479 transitions. [2019-12-07 13:01:56,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:01:56,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 13:01:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:56,416 INFO L225 Difference]: With dead ends: 23499 [2019-12-07 13:01:56,416 INFO L226 Difference]: Without dead ends: 23499 [2019-12-07 13:01:56,416 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 13:01:56,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23499 states. [2019-12-07 13:01:56,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23499 to 17758. [2019-12-07 13:01:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17758 states. [2019-12-07 13:01:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17758 states to 17758 states and 52847 transitions. [2019-12-07 13:01:56,707 INFO L78 Accepts]: Start accepts. Automaton has 17758 states and 52847 transitions. Word has length 27 [2019-12-07 13:01:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:56,707 INFO L462 AbstractCegarLoop]: Abstraction has 17758 states and 52847 transitions. [2019-12-07 13:01:56,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:01:56,707 INFO L276 IsEmpty]: Start isEmpty. Operand 17758 states and 52847 transitions. [2019-12-07 13:01:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:01:56,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:56,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:56,718 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:56,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:56,718 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-07 13:01:56,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:56,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848061819] [2019-12-07 13:01:56,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:01:56,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848061819] [2019-12-07 13:01:56,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:56,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:01:56,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297030066] [2019-12-07 13:01:56,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:01:56,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:01:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:01:56,764 INFO L87 Difference]: Start difference. First operand 17758 states and 52847 transitions. Second operand 5 states. [2019-12-07 13:01:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:57,025 INFO L93 Difference]: Finished difference Result 21964 states and 64554 transitions. [2019-12-07 13:01:57,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:01:57,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 13:01:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:57,051 INFO L225 Difference]: With dead ends: 21964 [2019-12-07 13:01:57,052 INFO L226 Difference]: Without dead ends: 21964 [2019-12-07 13:01:57,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 13:01:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21964 states. [2019-12-07 13:01:57,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21964 to 20594. [2019-12-07 13:01:57,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20594 states. [2019-12-07 13:01:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 61091 transitions. [2019-12-07 13:01:57,349 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 61091 transitions. Word has length 27 [2019-12-07 13:01:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:57,349 INFO L462 AbstractCegarLoop]: Abstraction has 20594 states and 61091 transitions. [2019-12-07 13:01:57,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:01:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 61091 transitions. [2019-12-07 13:01:57,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 13:01:57,361 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:57,361 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 13:01:57,361 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:57,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-07 13:01:57,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:57,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311808237] [2019-12-07 13:01:57,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:57,418 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 13:01:57,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311808237] [2019-12-07 13:01:57,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:57,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:01:57,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011325049] [2019-12-07 13:01:57,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:01:57,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:57,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:01:57,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:01:57,420 INFO L87 Difference]: Start difference. First operand 20594 states and 61091 transitions. Second operand 5 states. [2019-12-07 13:01:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:57,498 INFO L93 Difference]: Finished difference Result 20911 states and 61888 transitions. [2019-12-07 13:01:57,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:01:57,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 13:01:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:57,520 INFO L225 Difference]: With dead ends: 20911 [2019-12-07 13:01:57,520 INFO L226 Difference]: Without dead ends: 20911 [2019-12-07 13:01:57,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:01:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20911 states. [2019-12-07 13:01:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20911 to 20911. [2019-12-07 13:01:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20911 states. [2019-12-07 13:01:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20911 states to 20911 states and 61888 transitions. [2019-12-07 13:01:57,812 INFO L78 Accepts]: Start accepts. Automaton has 20911 states and 61888 transitions. Word has length 28 [2019-12-07 13:01:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:57,812 INFO L462 AbstractCegarLoop]: Abstraction has 20911 states and 61888 transitions. [2019-12-07 13:01:57,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:01:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 20911 states and 61888 transitions. [2019-12-07 13:01:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:01:57,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:57,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] [2019-12-07 13:01:57,826 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:57,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:57,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1714199023, now seen corresponding path program 1 times [2019-12-07 13:01:57,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:57,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388192810] [2019-12-07 13:01:57,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:57,878 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 13:01:57,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388192810] [2019-12-07 13:01:57,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:57,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:01:57,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013247336] [2019-12-07 13:01:57,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:01:57,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:01:57,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:01:57,879 INFO L87 Difference]: Start difference. First operand 20911 states and 61888 transitions. Second operand 5 states. [2019-12-07 13:01:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:58,111 INFO L93 Difference]: Finished difference Result 24383 states and 71254 transitions. [2019-12-07 13:01:58,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:01:58,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 13:01:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:58,134 INFO L225 Difference]: With dead ends: 24383 [2019-12-07 13:01:58,135 INFO L226 Difference]: Without dead ends: 24383 [2019-12-07 13:01:58,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 13:01:58,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24383 states. [2019-12-07 13:01:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24383 to 21026. [2019-12-07 13:01:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21026 states. [2019-12-07 13:01:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21026 states to 21026 states and 62164 transitions. [2019-12-07 13:01:58,468 INFO L78 Accepts]: Start accepts. Automaton has 21026 states and 62164 transitions. Word has length 29 [2019-12-07 13:01:58,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:58,468 INFO L462 AbstractCegarLoop]: Abstraction has 21026 states and 62164 transitions. [2019-12-07 13:01:58,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:01:58,468 INFO L276 IsEmpty]: Start isEmpty. Operand 21026 states and 62164 transitions. [2019-12-07 13:01:58,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:01:58,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:58,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:58,484 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:58,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:58,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-07 13:01:58,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:58,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967705992] [2019-12-07 13:01:58,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:58,548 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 13:01:58,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967705992] [2019-12-07 13:01:58,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:58,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:01:58,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060438776] [2019-12-07 13:01:58,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:01:58,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:58,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:01:58,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:01:58,549 INFO L87 Difference]: Start difference. First operand 21026 states and 62164 transitions. Second operand 6 states. [2019-12-07 13:01:58,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:58,991 INFO L93 Difference]: Finished difference Result 27860 states and 80966 transitions. [2019-12-07 13:01:58,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:01:58,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 13:01:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:59,020 INFO L225 Difference]: With dead ends: 27860 [2019-12-07 13:01:59,021 INFO L226 Difference]: Without dead ends: 27860 [2019-12-07 13:01:59,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:01:59,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27860 states. [2019-12-07 13:01:59,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27860 to 22078. [2019-12-07 13:01:59,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22078 states. [2019-12-07 13:01:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22078 states to 22078 states and 65194 transitions. [2019-12-07 13:01:59,374 INFO L78 Accepts]: Start accepts. Automaton has 22078 states and 65194 transitions. Word has length 33 [2019-12-07 13:01:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:59,374 INFO L462 AbstractCegarLoop]: Abstraction has 22078 states and 65194 transitions. [2019-12-07 13:01:59,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:01:59,374 INFO L276 IsEmpty]: Start isEmpty. Operand 22078 states and 65194 transitions. [2019-12-07 13:01:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 13:01:59,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:59,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:59,388 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:59,388 INFO L82 PathProgramCache]: Analyzing trace with hash -617380767, now seen corresponding path program 1 times [2019-12-07 13:01:59,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:01:59,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824323598] [2019-12-07 13:01:59,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:01:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:59,438 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 13:01:59,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824323598] [2019-12-07 13:01:59,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:01:59,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:01:59,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969636150] [2019-12-07 13:01:59,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:01:59,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:01:59,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:01:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:01:59,439 INFO L87 Difference]: Start difference. First operand 22078 states and 65194 transitions. Second operand 6 states. [2019-12-07 13:01:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:59,866 INFO L93 Difference]: Finished difference Result 27029 states and 78779 transitions. [2019-12-07 13:01:59,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:01:59,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-07 13:01:59,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:59,896 INFO L225 Difference]: With dead ends: 27029 [2019-12-07 13:01:59,896 INFO L226 Difference]: Without dead ends: 27029 [2019-12-07 13:01:59,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:02:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27029 states. [2019-12-07 13:02:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27029 to 19090. [2019-12-07 13:02:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19090 states. [2019-12-07 13:02:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19090 states to 19090 states and 56687 transitions. [2019-12-07 13:02:00,219 INFO L78 Accepts]: Start accepts. Automaton has 19090 states and 56687 transitions. Word has length 35 [2019-12-07 13:02:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:00,219 INFO L462 AbstractCegarLoop]: Abstraction has 19090 states and 56687 transitions. [2019-12-07 13:02:00,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:02:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 19090 states and 56687 transitions. [2019-12-07 13:02:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:02:00,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:00,233 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:00,233 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:00,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:00,233 INFO L82 PathProgramCache]: Analyzing trace with hash -282480739, now seen corresponding path program 1 times [2019-12-07 13:02:00,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:00,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860040110] [2019-12-07 13:02:00,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:00,287 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 13:02:00,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860040110] [2019-12-07 13:02:00,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:00,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:00,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548310693] [2019-12-07 13:02:00,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:00,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:00,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:00,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:00,289 INFO L87 Difference]: Start difference. First operand 19090 states and 56687 transitions. Second operand 3 states. [2019-12-07 13:02:00,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:00,347 INFO L93 Difference]: Finished difference Result 19090 states and 56611 transitions. [2019-12-07 13:02:00,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:00,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 13:02:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:00,368 INFO L225 Difference]: With dead ends: 19090 [2019-12-07 13:02:00,369 INFO L226 Difference]: Without dead ends: 19090 [2019-12-07 13:02:00,369 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 13:02:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19090 states. [2019-12-07 13:02:00,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19090 to 17041. [2019-12-07 13:02:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17041 states. [2019-12-07 13:02:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17041 states to 17041 states and 50985 transitions. [2019-12-07 13:02:00,626 INFO L78 Accepts]: Start accepts. Automaton has 17041 states and 50985 transitions. Word has length 39 [2019-12-07 13:02:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:00,626 INFO L462 AbstractCegarLoop]: Abstraction has 17041 states and 50985 transitions. [2019-12-07 13:02:00,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 17041 states and 50985 transitions. [2019-12-07 13:02:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 13:02:00,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:00,641 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 13:02:00,641 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:00,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:00,641 INFO L82 PathProgramCache]: Analyzing trace with hash -730896502, now seen corresponding path program 1 times [2019-12-07 13:02:00,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:00,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131423008] [2019-12-07 13:02:00,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:02:00,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131423008] [2019-12-07 13:02:00,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:00,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:00,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398863079] [2019-12-07 13:02:00,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:00,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:00,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:00,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:00,670 INFO L87 Difference]: Start difference. First operand 17041 states and 50985 transitions. Second operand 3 states. [2019-12-07 13:02:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:00,714 INFO L93 Difference]: Finished difference Result 16147 states and 47526 transitions. [2019-12-07 13:02:00,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:00,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 13:02:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:00,732 INFO L225 Difference]: With dead ends: 16147 [2019-12-07 13:02:00,733 INFO L226 Difference]: Without dead ends: 16147 [2019-12-07 13:02:00,733 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 13:02:00,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16147 states. [2019-12-07 13:02:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16147 to 15873. [2019-12-07 13:02:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15873 states. [2019-12-07 13:02:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15873 states to 15873 states and 46758 transitions. [2019-12-07 13:02:00,961 INFO L78 Accepts]: Start accepts. Automaton has 15873 states and 46758 transitions. Word has length 40 [2019-12-07 13:02:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:00,962 INFO L462 AbstractCegarLoop]: Abstraction has 15873 states and 46758 transitions. [2019-12-07 13:02:00,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 15873 states and 46758 transitions. [2019-12-07 13:02:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 13:02:00,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:00,973 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] [2019-12-07 13:02:00,973 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:00,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1449769855, now seen corresponding path program 1 times [2019-12-07 13:02:00,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:00,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628716039] [2019-12-07 13:02:00,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:02:01,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628716039] [2019-12-07 13:02:01,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:01,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:01,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137382524] [2019-12-07 13:02:01,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:02:01,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:01,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:02:01,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:02:01,028 INFO L87 Difference]: Start difference. First operand 15873 states and 46758 transitions. Second operand 4 states. [2019-12-07 13:02:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:01,072 INFO L93 Difference]: Finished difference Result 15872 states and 46756 transitions. [2019-12-07 13:02:01,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:02:01,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 13:02:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:01,089 INFO L225 Difference]: With dead ends: 15872 [2019-12-07 13:02:01,089 INFO L226 Difference]: Without dead ends: 15872 [2019-12-07 13:02:01,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:02:01,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15872 states. [2019-12-07 13:02:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15872 to 15872. [2019-12-07 13:02:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15872 states. [2019-12-07 13:02:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15872 states to 15872 states and 46756 transitions. [2019-12-07 13:02:01,316 INFO L78 Accepts]: Start accepts. Automaton has 15872 states and 46756 transitions. Word has length 41 [2019-12-07 13:02:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:01,316 INFO L462 AbstractCegarLoop]: Abstraction has 15872 states and 46756 transitions. [2019-12-07 13:02:01,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:02:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 15872 states and 46756 transitions. [2019-12-07 13:02:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 13:02:01,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:01,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:01,329 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:01,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:01,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1030510862, now seen corresponding path program 1 times [2019-12-07 13:02:01,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:01,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189447489] [2019-12-07 13:02:01,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:01,365 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 13:02:01,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189447489] [2019-12-07 13:02:01,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:01,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:02:01,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034551362] [2019-12-07 13:02:01,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:02:01,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:01,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:02:01,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:02:01,366 INFO L87 Difference]: Start difference. First operand 15872 states and 46756 transitions. Second operand 5 states. [2019-12-07 13:02:01,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:01,411 INFO L93 Difference]: Finished difference Result 14708 states and 44273 transitions. [2019-12-07 13:02:01,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:02:01,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 13:02:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:01,427 INFO L225 Difference]: With dead ends: 14708 [2019-12-07 13:02:01,428 INFO L226 Difference]: Without dead ends: 14708 [2019-12-07 13:02:01,428 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 13:02:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14708 states. [2019-12-07 13:02:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14708 to 14708. [2019-12-07 13:02:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14708 states. [2019-12-07 13:02:01,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14708 states to 14708 states and 44273 transitions. [2019-12-07 13:02:01,639 INFO L78 Accepts]: Start accepts. Automaton has 14708 states and 44273 transitions. Word has length 42 [2019-12-07 13:02:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:01,640 INFO L462 AbstractCegarLoop]: Abstraction has 14708 states and 44273 transitions. [2019-12-07 13:02:01,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:02:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 14708 states and 44273 transitions. [2019-12-07 13:02:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:02:01,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:01,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:01,651 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:01,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1200274173, now seen corresponding path program 1 times [2019-12-07 13:02:01,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:01,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632969660] [2019-12-07 13:02:01,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:01,690 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 13:02:01,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632969660] [2019-12-07 13:02:01,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:01,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:02:01,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487992755] [2019-12-07 13:02:01,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:02:01,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:01,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:02:01,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:02:01,692 INFO L87 Difference]: Start difference. First operand 14708 states and 44273 transitions. Second operand 3 states. [2019-12-07 13:02:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:01,764 INFO L93 Difference]: Finished difference Result 17200 states and 51557 transitions. [2019-12-07 13:02:01,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:02:01,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 13:02:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:01,783 INFO L225 Difference]: With dead ends: 17200 [2019-12-07 13:02:01,783 INFO L226 Difference]: Without dead ends: 17200 [2019-12-07 13:02:01,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 13:02:01,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17200 states. [2019-12-07 13:02:01,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17200 to 13469. [2019-12-07 13:02:01,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13469 states. [2019-12-07 13:02:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13469 states to 13469 states and 40657 transitions. [2019-12-07 13:02:02,009 INFO L78 Accepts]: Start accepts. Automaton has 13469 states and 40657 transitions. Word has length 66 [2019-12-07 13:02:02,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:02,009 INFO L462 AbstractCegarLoop]: Abstraction has 13469 states and 40657 transitions. [2019-12-07 13:02:02,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:02:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 13469 states and 40657 transitions. [2019-12-07 13:02:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:02:02,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:02,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:02,021 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:02,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:02,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-07 13:02:02,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:02,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525712079] [2019-12-07 13:02:02,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:02,359 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 13:02:02,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525712079] [2019-12-07 13:02:02,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:02,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 13:02:02,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255552892] [2019-12-07 13:02:02,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:02:02,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:02,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:02:02,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:02:02,360 INFO L87 Difference]: Start difference. First operand 13469 states and 40657 transitions. Second operand 15 states. [2019-12-07 13:02:08,632 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-07 13:02:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:11,349 INFO L93 Difference]: Finished difference Result 56191 states and 166791 transitions. [2019-12-07 13:02:11,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-12-07 13:02:11,349 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-07 13:02:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:11,388 INFO L225 Difference]: With dead ends: 56191 [2019-12-07 13:02:11,388 INFO L226 Difference]: Without dead ends: 33791 [2019-12-07 13:02:11,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4431 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1691, Invalid=10081, Unknown=0, NotChecked=0, Total=11772 [2019-12-07 13:02:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33791 states. [2019-12-07 13:02:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33791 to 16468. [2019-12-07 13:02:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16468 states. [2019-12-07 13:02:11,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16468 states to 16468 states and 49140 transitions. [2019-12-07 13:02:11,748 INFO L78 Accepts]: Start accepts. Automaton has 16468 states and 49140 transitions. Word has length 67 [2019-12-07 13:02:11,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:11,749 INFO L462 AbstractCegarLoop]: Abstraction has 16468 states and 49140 transitions. [2019-12-07 13:02:11,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:02:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 16468 states and 49140 transitions. [2019-12-07 13:02:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:02:11,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:11,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:11,762 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:11,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1847571895, now seen corresponding path program 2 times [2019-12-07 13:02:11,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:11,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929169885] [2019-12-07 13:02:11,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:02:11,836 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 13:02:11,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929169885] [2019-12-07 13:02:11,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:02:11,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:02:11,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546645817] [2019-12-07 13:02:11,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:02:11,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:02:11,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:02:11,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:02:11,837 INFO L87 Difference]: Start difference. First operand 16468 states and 49140 transitions. Second operand 8 states. [2019-12-07 13:02:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:02:12,119 INFO L93 Difference]: Finished difference Result 41070 states and 120424 transitions. [2019-12-07 13:02:12,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:02:12,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-07 13:02:12,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:02:12,152 INFO L225 Difference]: With dead ends: 41070 [2019-12-07 13:02:12,152 INFO L226 Difference]: Without dead ends: 31117 [2019-12-07 13:02:12,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:02:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31117 states. [2019-12-07 13:02:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31117 to 16753. [2019-12-07 13:02:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16753 states. [2019-12-07 13:02:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16753 states to 16753 states and 50025 transitions. [2019-12-07 13:02:12,491 INFO L78 Accepts]: Start accepts. Automaton has 16753 states and 50025 transitions. Word has length 67 [2019-12-07 13:02:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:02:12,491 INFO L462 AbstractCegarLoop]: Abstraction has 16753 states and 50025 transitions. [2019-12-07 13:02:12,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:02:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 16753 states and 50025 transitions. [2019-12-07 13:02:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:02:12,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:02:12,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:02:12,505 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:02:12,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:02:12,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 3 times [2019-12-07 13:02:12,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:02:12,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925290103] [2019-12-07 13:02:12,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:02:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:02:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:02:12,581 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:02:12,581 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:02:12,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= |v_ULTIMATE.start_main_~#t925~0.offset_22| 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t925~0.base_30| 1) |v_#valid_67|) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t925~0.base_30|) 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t925~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t925~0.base_30|) |v_ULTIMATE.start_main_~#t925~0.offset_22| 0)) |v_#memory_int_19|) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~a$w_buff1_used~0_450) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t925~0.base_30| 4)) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= v_~a$mem_tmp~0_16 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= 0 v_~x~0_153) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t925~0.base_30|) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ULTIMATE.start_main_~#t926~0.offset=|v_ULTIMATE.start_main_~#t926~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ULTIMATE.start_main_~#t926~0.base=|v_ULTIMATE.start_main_~#t926~0.base_23|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ULTIMATE.start_main_~#t927~0.offset=|v_ULTIMATE.start_main_~#t927~0.offset_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ULTIMATE.start_main_~#t925~0.base=|v_ULTIMATE.start_main_~#t925~0.base_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~x~0=v_~x~0_153, ULTIMATE.start_main_~#t927~0.base=|v_ULTIMATE.start_main_~#t927~0.base_15|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ULTIMATE.start_main_~#t925~0.offset=|v_ULTIMATE.start_main_~#t925~0.offset_22|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t926~0.offset, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t926~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t927~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t925~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t927~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t925~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 13:02:12,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (= ~a$r_buff0_thd0~0_In-2084699097 ~a$r_buff1_thd0~0_Out-2084699097) (= ~a$r_buff1_thd1~0_Out-2084699097 ~a$r_buff0_thd1~0_In-2084699097) (= 1 ~a$r_buff0_thd1~0_Out-2084699097) (= ~x~0_In-2084699097 ~__unbuffered_p0_EAX~0_Out-2084699097) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2084699097)) (= ~a$r_buff0_thd3~0_In-2084699097 ~a$r_buff1_thd3~0_Out-2084699097) (= ~a$r_buff1_thd2~0_Out-2084699097 ~a$r_buff0_thd2~0_In-2084699097)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2084699097, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2084699097, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2084699097, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2084699097, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2084699097, ~x~0=~x~0_In-2084699097} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-2084699097, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-2084699097, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-2084699097, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-2084699097, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2084699097, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-2084699097, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2084699097, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2084699097, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-2084699097, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2084699097, ~x~0=~x~0_In-2084699097} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:02:12,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t926~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t926~0.base_11|) |v_ULTIMATE.start_main_~#t926~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t926~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t926~0.base_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t926~0.base_11|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t926~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t926~0.base_11| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t926~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t926~0.offset=|v_ULTIMATE.start_main_~#t926~0.offset_10|, ULTIMATE.start_main_~#t926~0.base=|v_ULTIMATE.start_main_~#t926~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t926~0.offset, ULTIMATE.start_main_~#t926~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:02:12,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= |v_ULTIMATE.start_main_~#t927~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t927~0.base_11|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t927~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t927~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t927~0.base_11|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t927~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t927~0.base_11|) |v_ULTIMATE.start_main_~#t927~0.offset_10| 2))) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t927~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t927~0.base=|v_ULTIMATE.start_main_~#t927~0.base_11|, ULTIMATE.start_main_~#t927~0.offset=|v_ULTIMATE.start_main_~#t927~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t927~0.base, ULTIMATE.start_main_~#t927~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 13:02:12,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1973018230 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1973018230 256) 0))) (or (and (= ~a$w_buff1~0_In1973018230 |P1Thread1of1ForFork2_#t~ite9_Out1973018230|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1973018230| ~a~0_In1973018230) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In1973018230, ~a$w_buff1~0=~a$w_buff1~0_In1973018230, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1973018230, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1973018230} OutVars{~a~0=~a~0_In1973018230, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1973018230|, ~a$w_buff1~0=~a$w_buff1~0_In1973018230, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1973018230, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1973018230} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 13:02:12,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_28| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_28|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_27|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_41|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 13:02:12,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1862558722 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1862558722 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1862558722 |P1Thread1of1ForFork2_#t~ite11_Out-1862558722|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1862558722|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1862558722, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1862558722} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1862558722, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1862558722, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1862558722|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:02:12,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1458574194 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1458574194 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1458574194 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1458574194 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1458574194| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1458574194| ~a$w_buff1_used~0_In-1458574194)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1458574194, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1458574194, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1458574194, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1458574194} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1458574194, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1458574194, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1458574194, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1458574194|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1458574194} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 13:02:12,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1068621965 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1068621965 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1068621965| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1068621965| ~a$r_buff0_thd2~0_In-1068621965) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1068621965, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1068621965} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1068621965, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1068621965, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1068621965|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 13:02:12,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In471443917 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In471443917 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In471443917 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In471443917 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out471443917|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd2~0_In471443917 |P1Thread1of1ForFork2_#t~ite14_Out471443917|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In471443917, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In471443917, ~a$w_buff0_used~0=~a$w_buff0_used~0_In471443917, ~a$w_buff1_used~0=~a$w_buff1_used~0_In471443917} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In471443917, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In471443917, ~a$w_buff0_used~0=~a$w_buff0_used~0_In471443917, ~a$w_buff1_used~0=~a$w_buff1_used~0_In471443917, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out471443917|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 13:02:12,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_22| v_~a$r_buff1_thd2~0_51) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_22|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_21|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 13:02:12,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In494766611 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In494766611 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out494766611| ~a$w_buff0_used~0_In494766611) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out494766611| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In494766611, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In494766611} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out494766611|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In494766611, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In494766611} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 13:02:12,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-2128820244 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-2128820244 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-2128820244 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-2128820244 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-2128820244| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-2128820244| ~a$w_buff1_used~0_In-2128820244) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2128820244, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2128820244, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2128820244, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2128820244} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2128820244|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2128820244, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2128820244, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2128820244, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2128820244} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 13:02:12,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-81912080 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-81912080 256))) (.cse2 (= ~a$r_buff0_thd1~0_Out-81912080 ~a$r_buff0_thd1~0_In-81912080))) (or (and (= ~a$r_buff0_thd1~0_Out-81912080 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-81912080, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-81912080} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-81912080|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-81912080, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-81912080} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:02:12,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-53880836 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-53880836 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-53880836 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-53880836 256)))) (or (and (= ~a$r_buff1_thd1~0_In-53880836 |P0Thread1of1ForFork1_#t~ite8_Out-53880836|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-53880836|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-53880836, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-53880836, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-53880836, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-53880836} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-53880836|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-53880836, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-53880836, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-53880836, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-53880836} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:02:12,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:02:12,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1914483738 256) 0))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1914483738 256) 0))) (or (= (mod ~a$w_buff0_used~0_In1914483738 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In1914483738 256)) .cse0) (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1914483738 256))))) .cse1 (= |P2Thread1of1ForFork0_#t~ite30_Out1914483738| |P2Thread1of1ForFork0_#t~ite29_Out1914483738|) (= ~a$w_buff1_used~0_In1914483738 |P2Thread1of1ForFork0_#t~ite29_Out1914483738|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite29_In1914483738| |P2Thread1of1ForFork0_#t~ite29_Out1914483738|) (= ~a$w_buff1_used~0_In1914483738 |P2Thread1of1ForFork0_#t~ite30_Out1914483738|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1914483738, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1914483738, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1914483738, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1914483738, ~weak$$choice2~0=~weak$$choice2~0_In1914483738, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1914483738|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1914483738, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1914483738, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1914483738, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1914483738, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1914483738|, ~weak$$choice2~0=~weak$$choice2~0_In1914483738, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1914483738|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:02:12,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 13:02:12,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_11|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 13:02:12,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In2024720771 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In2024720771 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out2024720771| ~a~0_In2024720771)) (and (not .cse0) (= ~a$w_buff1~0_In2024720771 |P2Thread1of1ForFork0_#t~ite38_Out2024720771|) (not .cse1)))) InVars {~a~0=~a~0_In2024720771, ~a$w_buff1~0=~a$w_buff1~0_In2024720771, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2024720771, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2024720771} OutVars{~a~0=~a~0_In2024720771, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2024720771|, ~a$w_buff1~0=~a$w_buff1~0_In2024720771, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2024720771, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2024720771} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 13:02:12,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_11|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 13:02:12,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1729998717 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1729998717 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1729998717|)) (and (= ~a$w_buff0_used~0_In1729998717 |P2Thread1of1ForFork0_#t~ite40_Out1729998717|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1729998717, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1729998717} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1729998717|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1729998717, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1729998717} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 13:02:12,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1176956819 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1176956819 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-1176956819 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-1176956819 256) 0))) (or (and (= ~a$w_buff1_used~0_In-1176956819 |P2Thread1of1ForFork0_#t~ite41_Out-1176956819|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1176956819|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1176956819, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1176956819, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1176956819, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1176956819} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1176956819, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1176956819, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1176956819, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1176956819, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1176956819|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 13:02:12,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-402265928 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-402265928 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-402265928| ~a$r_buff0_thd3~0_In-402265928)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-402265928|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-402265928, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-402265928} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-402265928, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-402265928, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-402265928|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 13:02:12,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In2116707585 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In2116707585 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In2116707585 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2116707585 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out2116707585| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In2116707585 |P2Thread1of1ForFork0_#t~ite43_Out2116707585|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2116707585, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2116707585, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2116707585, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2116707585} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out2116707585|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2116707585, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2116707585, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2116707585, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2116707585} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 13:02:12,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_32|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_31|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 13:02:12,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:02:12,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-1544396343| |ULTIMATE.start_main_#t~ite47_Out-1544396343|)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1544396343 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1544396343 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~a$w_buff1~0_In-1544396343 |ULTIMATE.start_main_#t~ite47_Out-1544396343|)) (and .cse1 (= ~a~0_In-1544396343 |ULTIMATE.start_main_#t~ite47_Out-1544396343|) (or .cse0 .cse2)))) InVars {~a~0=~a~0_In-1544396343, ~a$w_buff1~0=~a$w_buff1~0_In-1544396343, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1544396343, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1544396343} OutVars{~a~0=~a~0_In-1544396343, ~a$w_buff1~0=~a$w_buff1~0_In-1544396343, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1544396343|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1544396343, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1544396343|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1544396343} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 13:02:12,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1494856955 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1494856955 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1494856955| ~a$w_buff0_used~0_In-1494856955)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1494856955| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1494856955, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1494856955} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1494856955, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1494856955|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1494856955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 13:02:12,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In2013993993 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In2013993993 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In2013993993 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2013993993 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out2013993993| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite50_Out2013993993| ~a$w_buff1_used~0_In2013993993)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2013993993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2013993993, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2013993993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2013993993} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2013993993|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2013993993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2013993993, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2013993993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2013993993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 13:02:12,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-237413785 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-237413785 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-237413785 |ULTIMATE.start_main_#t~ite51_Out-237413785|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-237413785| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-237413785, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-237413785} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-237413785|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-237413785, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-237413785} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 13:02:12,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-1452009368 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1452009368 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1452009368 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1452009368 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1452009368| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-1452009368| ~a$r_buff1_thd0~0_In-1452009368)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1452009368, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1452009368, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1452009368, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1452009368} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1452009368|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1452009368, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1452009368, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1452009368, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1452009368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 13:02:12,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= 0 v_~__unbuffered_p0_EAX~0_128))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:02:12,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:02:12 BasicIcfg [2019-12-07 13:02:12,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:02:12,647 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:02:12,647 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:02:12,647 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:02:12,647 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:01:09" (3/4) ... [2019-12-07 13:02:12,648 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:02:12,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= |v_ULTIMATE.start_main_~#t925~0.offset_22| 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t925~0.base_30| 1) |v_#valid_67|) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t925~0.base_30|) 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t925~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t925~0.base_30|) |v_ULTIMATE.start_main_~#t925~0.offset_22| 0)) |v_#memory_int_19|) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~a$w_buff1_used~0_450) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t925~0.base_30| 4)) (= 0 v_~__unbuffered_p0_EAX~0_159) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= v_~a$mem_tmp~0_16 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= 0 v_~x~0_153) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t925~0.base_30|) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ULTIMATE.start_main_~#t926~0.offset=|v_ULTIMATE.start_main_~#t926~0.offset_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ULTIMATE.start_main_~#t926~0.base=|v_ULTIMATE.start_main_~#t926~0.base_23|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ULTIMATE.start_main_~#t927~0.offset=|v_ULTIMATE.start_main_~#t927~0.offset_13|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ULTIMATE.start_main_~#t925~0.base=|v_ULTIMATE.start_main_~#t925~0.base_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~x~0=v_~x~0_153, ULTIMATE.start_main_~#t927~0.base=|v_ULTIMATE.start_main_~#t927~0.base_15|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ULTIMATE.start_main_~#t925~0.offset=|v_ULTIMATE.start_main_~#t925~0.offset_22|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t926~0.offset, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t926~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t927~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t925~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t927~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t925~0.offset, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 13:02:12,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (= ~a$r_buff0_thd0~0_In-2084699097 ~a$r_buff1_thd0~0_Out-2084699097) (= ~a$r_buff1_thd1~0_Out-2084699097 ~a$r_buff0_thd1~0_In-2084699097) (= 1 ~a$r_buff0_thd1~0_Out-2084699097) (= ~x~0_In-2084699097 ~__unbuffered_p0_EAX~0_Out-2084699097) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2084699097)) (= ~a$r_buff0_thd3~0_In-2084699097 ~a$r_buff1_thd3~0_Out-2084699097) (= ~a$r_buff1_thd2~0_Out-2084699097 ~a$r_buff0_thd2~0_In-2084699097)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2084699097, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2084699097, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2084699097, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2084699097, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2084699097, ~x~0=~x~0_In-2084699097} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-2084699097, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-2084699097, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-2084699097, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-2084699097, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2084699097, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-2084699097, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2084699097, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-2084699097, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-2084699097, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2084699097, ~x~0=~x~0_In-2084699097} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:02:12,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t926~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t926~0.base_11|) |v_ULTIMATE.start_main_~#t926~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t926~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t926~0.base_11|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t926~0.base_11|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t926~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t926~0.base_11| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t926~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t926~0.offset=|v_ULTIMATE.start_main_~#t926~0.offset_10|, ULTIMATE.start_main_~#t926~0.base=|v_ULTIMATE.start_main_~#t926~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t926~0.offset, ULTIMATE.start_main_~#t926~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:02:12,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= |v_ULTIMATE.start_main_~#t927~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t927~0.base_11|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t927~0.base_11|) 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t927~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t927~0.base_11|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t927~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t927~0.base_11|) |v_ULTIMATE.start_main_~#t927~0.offset_10| 2))) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t927~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t927~0.base=|v_ULTIMATE.start_main_~#t927~0.base_11|, ULTIMATE.start_main_~#t927~0.offset=|v_ULTIMATE.start_main_~#t927~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t927~0.base, ULTIMATE.start_main_~#t927~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-07 13:02:12,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In1973018230 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1973018230 256) 0))) (or (and (= ~a$w_buff1~0_In1973018230 |P1Thread1of1ForFork2_#t~ite9_Out1973018230|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1973018230| ~a~0_In1973018230) (or .cse1 .cse0)))) InVars {~a~0=~a~0_In1973018230, ~a$w_buff1~0=~a$w_buff1~0_In1973018230, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1973018230, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1973018230} OutVars{~a~0=~a~0_In1973018230, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1973018230|, ~a$w_buff1~0=~a$w_buff1~0_In1973018230, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1973018230, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1973018230} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 13:02:12,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_28| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_28|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_27|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_41|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 13:02:12,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1862558722 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1862558722 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1862558722 |P1Thread1of1ForFork2_#t~ite11_Out-1862558722|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1862558722|) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1862558722, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1862558722} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1862558722, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1862558722, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1862558722|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:02:12,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1458574194 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In-1458574194 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1458574194 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1458574194 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1458574194| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite12_Out-1458574194| ~a$w_buff1_used~0_In-1458574194)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1458574194, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1458574194, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1458574194, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1458574194} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1458574194, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1458574194, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1458574194, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1458574194|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1458574194} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 13:02:12,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1068621965 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1068621965 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1068621965| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1068621965| ~a$r_buff0_thd2~0_In-1068621965) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1068621965, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1068621965} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1068621965, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1068621965, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1068621965|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 13:02:12,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In471443917 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In471443917 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In471443917 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In471443917 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out471443917|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd2~0_In471443917 |P1Thread1of1ForFork2_#t~ite14_Out471443917|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In471443917, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In471443917, ~a$w_buff0_used~0=~a$w_buff0_used~0_In471443917, ~a$w_buff1_used~0=~a$w_buff1_used~0_In471443917} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In471443917, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In471443917, ~a$w_buff0_used~0=~a$w_buff0_used~0_In471443917, ~a$w_buff1_used~0=~a$w_buff1_used~0_In471443917, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out471443917|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 13:02:12,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_22| v_~a$r_buff1_thd2~0_51) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_22|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_21|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 13:02:12,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In494766611 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In494766611 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out494766611| ~a$w_buff0_used~0_In494766611) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out494766611| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In494766611, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In494766611} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out494766611|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In494766611, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In494766611} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 13:02:12,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-2128820244 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-2128820244 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-2128820244 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-2128820244 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-2128820244| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-2128820244| ~a$w_buff1_used~0_In-2128820244) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2128820244, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2128820244, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2128820244, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2128820244} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-2128820244|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2128820244, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2128820244, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2128820244, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2128820244} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 13:02:12,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-81912080 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-81912080 256))) (.cse2 (= ~a$r_buff0_thd1~0_Out-81912080 ~a$r_buff0_thd1~0_In-81912080))) (or (and (= ~a$r_buff0_thd1~0_Out-81912080 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-81912080, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-81912080} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-81912080|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-81912080, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-81912080} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:02:12,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-53880836 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-53880836 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-53880836 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-53880836 256)))) (or (and (= ~a$r_buff1_thd1~0_In-53880836 |P0Thread1of1ForFork1_#t~ite8_Out-53880836|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-53880836|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-53880836, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-53880836, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-53880836, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-53880836} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-53880836|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-53880836, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-53880836, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-53880836, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-53880836} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:02:12,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:02:12,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1914483738 256) 0))) (or (and (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In1914483738 256) 0))) (or (= (mod ~a$w_buff0_used~0_In1914483738 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In1914483738 256)) .cse0) (and .cse0 (= 0 (mod ~a$r_buff1_thd3~0_In1914483738 256))))) .cse1 (= |P2Thread1of1ForFork0_#t~ite30_Out1914483738| |P2Thread1of1ForFork0_#t~ite29_Out1914483738|) (= ~a$w_buff1_used~0_In1914483738 |P2Thread1of1ForFork0_#t~ite29_Out1914483738|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite29_In1914483738| |P2Thread1of1ForFork0_#t~ite29_Out1914483738|) (= ~a$w_buff1_used~0_In1914483738 |P2Thread1of1ForFork0_#t~ite30_Out1914483738|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1914483738, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1914483738, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1914483738, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1914483738, ~weak$$choice2~0=~weak$$choice2~0_In1914483738, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1914483738|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1914483738, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1914483738, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1914483738, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1914483738, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1914483738|, ~weak$$choice2~0=~weak$$choice2~0_In1914483738, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1914483738|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:02:12,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 13:02:12,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_11|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 13:02:12,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In2024720771 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In2024720771 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out2024720771| ~a~0_In2024720771)) (and (not .cse0) (= ~a$w_buff1~0_In2024720771 |P2Thread1of1ForFork0_#t~ite38_Out2024720771|) (not .cse1)))) InVars {~a~0=~a~0_In2024720771, ~a$w_buff1~0=~a$w_buff1~0_In2024720771, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2024720771, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2024720771} OutVars{~a~0=~a~0_In2024720771, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2024720771|, ~a$w_buff1~0=~a$w_buff1~0_In2024720771, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2024720771, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2024720771} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 13:02:12,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_11|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 13:02:12,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1729998717 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1729998717 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1729998717|)) (and (= ~a$w_buff0_used~0_In1729998717 |P2Thread1of1ForFork0_#t~ite40_Out1729998717|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1729998717, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1729998717} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1729998717|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1729998717, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1729998717} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 13:02:12,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1176956819 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1176956819 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-1176956819 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-1176956819 256) 0))) (or (and (= ~a$w_buff1_used~0_In-1176956819 |P2Thread1of1ForFork0_#t~ite41_Out-1176956819|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1176956819|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1176956819, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1176956819, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1176956819, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1176956819} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1176956819, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1176956819, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1176956819, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1176956819, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1176956819|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 13:02:12,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-402265928 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-402265928 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-402265928| ~a$r_buff0_thd3~0_In-402265928)) (and (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-402265928|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-402265928, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-402265928} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-402265928, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-402265928, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-402265928|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 13:02:12,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In2116707585 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd3~0_In2116707585 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In2116707585 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2116707585 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out2116707585| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In2116707585 |P2Thread1of1ForFork0_#t~ite43_Out2116707585|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2116707585, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2116707585, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2116707585, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2116707585} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out2116707585|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2116707585, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2116707585, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2116707585, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2116707585} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 13:02:12,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_32|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_31|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 13:02:12,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:02:12,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-1544396343| |ULTIMATE.start_main_#t~ite47_Out-1544396343|)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1544396343 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1544396343 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~a$w_buff1~0_In-1544396343 |ULTIMATE.start_main_#t~ite47_Out-1544396343|)) (and .cse1 (= ~a~0_In-1544396343 |ULTIMATE.start_main_#t~ite47_Out-1544396343|) (or .cse0 .cse2)))) InVars {~a~0=~a~0_In-1544396343, ~a$w_buff1~0=~a$w_buff1~0_In-1544396343, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1544396343, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1544396343} OutVars{~a~0=~a~0_In-1544396343, ~a$w_buff1~0=~a$w_buff1~0_In-1544396343, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1544396343|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1544396343, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1544396343|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1544396343} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 13:02:12,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1494856955 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1494856955 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1494856955| ~a$w_buff0_used~0_In-1494856955)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1494856955| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1494856955, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1494856955} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1494856955, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1494856955|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1494856955} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 13:02:12,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In2013993993 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In2013993993 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In2013993993 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2013993993 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out2013993993| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite50_Out2013993993| ~a$w_buff1_used~0_In2013993993)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2013993993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2013993993, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2013993993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2013993993} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2013993993|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2013993993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2013993993, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2013993993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2013993993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 13:02:12,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-237413785 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-237413785 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-237413785 |ULTIMATE.start_main_#t~ite51_Out-237413785|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-237413785| 0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-237413785, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-237413785} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-237413785|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-237413785, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-237413785} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 13:02:12,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-1452009368 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1452009368 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1452009368 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1452009368 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1452009368| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite52_Out-1452009368| ~a$r_buff1_thd0~0_In-1452009368)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1452009368, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1452009368, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1452009368, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1452009368} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1452009368|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1452009368, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1452009368, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1452009368, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1452009368} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 13:02:12,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= 0 v_~__unbuffered_p0_EAX~0_128))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:02:12,713 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6ff2dd79-b920-400c-a728-b3a2f8d03677/bin/uautomizer/witness.graphml [2019-12-07 13:02:12,713 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:02:12,714 INFO L168 Benchmark]: Toolchain (without parser) took 63615.74 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.5 GB). Free memory was 937.2 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 13:02:12,714 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:02:12,714 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:12,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:12,715 INFO L168 Benchmark]: Boogie Preprocessor took 25.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:02:12,715 INFO L168 Benchmark]: RCFGBuilder took 412.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:12,715 INFO L168 Benchmark]: TraceAbstraction took 62678.87 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 13:02:12,716 INFO L168 Benchmark]: Witness Printer took 66.40 ms. Allocated memory is still 5.6 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:02:12,717 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 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 412.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 62678.87 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.4 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 66.40 ms. Allocated memory is still 5.6 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 59.0 MB). Peak memory consumption was 59.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t925, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t926, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t927, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 62.5s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4440 SDtfs, 4644 SDslu, 12281 SDs, 0 SdLazy, 8455 SolverSat, 212 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4492 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155174occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 136223 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 752 NumberOfCodeBlocks, 752 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 663 ConstructedInterpolants, 0 QuantifiedInterpolants, 184917 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...