./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/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 5d2cd970f76a76b84bde79762c11ce7e22c69784 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:19:57,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:19:57,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:19:57,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:19:57,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:19:57,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:19:57,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:19:57,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:19:57,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:19:57,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:19:57,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:19:57,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:19:57,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:19:57,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:19:57,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:19:57,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:19:57,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:19:57,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:19:57,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:19:57,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:19:57,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:19:57,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:19:57,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:19:57,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:19:57,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:19:57,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:19:57,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:19:57,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:19:57,586 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:19:57,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:19:57,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:19:57,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:19:57,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:19:57,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:19:57,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:19:57,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:19:57,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:19:57,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:19:57,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:19:57,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:19:57,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:19:57,591 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:19:57,600 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:19:57,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:19:57,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:19:57,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:19:57,601 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:19:57,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:19:57,602 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:19:57,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:19:57,602 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:19:57,602 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:19:57,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:19:57,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:19:57,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:19:57,603 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:19:57,603 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:19:57,603 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:19:57,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:19:57,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:19:57,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:19:57,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:19:57,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:19:57,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:19:57,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:19:57,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:19:57,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:19:57,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:19:57,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:19:57,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:19:57,604 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:19:57,605 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_85e1602f-8bf1-43cf-a98b-001189c3fbcc/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 -> 5d2cd970f76a76b84bde79762c11ce7e22c69784 [2019-12-07 18:19:57,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:19:57,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:19:57,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:19:57,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:19:57,717 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:19:57,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i [2019-12-07 18:19:57,755 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/data/373c443f8/7d35cf898aee478aa86a6489be12dd25/FLAG6d83db2d7 [2019-12-07 18:19:58,128 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:19:58,128 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/sv-benchmarks/c/pthread-wmm/mix031_tso.opt.i [2019-12-07 18:19:58,139 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/data/373c443f8/7d35cf898aee478aa86a6489be12dd25/FLAG6d83db2d7 [2019-12-07 18:19:58,151 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/data/373c443f8/7d35cf898aee478aa86a6489be12dd25 [2019-12-07 18:19:58,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:19:58,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:19:58,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:19:58,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:19:58,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:19:58,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:19:58" (1/1) ... [2019-12-07 18:19:58,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58, skipping insertion in model container [2019-12-07 18:19:58,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:19:58" (1/1) ... [2019-12-07 18:19:58,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:19:58,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:19:58,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:19:58,444 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:19:58,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:19:58,530 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:19:58,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58 WrapperNode [2019-12-07 18:19:58,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:19:58,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:19:58,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:19:58,532 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:19:58,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58" (1/1) ... [2019-12-07 18:19:58,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58" (1/1) ... [2019-12-07 18:19:58,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:19:58,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:19:58,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:19:58,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:19:58,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58" (1/1) ... [2019-12-07 18:19:58,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58" (1/1) ... [2019-12-07 18:19:58,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58" (1/1) ... [2019-12-07 18:19:58,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58" (1/1) ... [2019-12-07 18:19:58,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58" (1/1) ... [2019-12-07 18:19:58,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58" (1/1) ... [2019-12-07 18:19:58,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58" (1/1) ... [2019-12-07 18:19:58,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:19:58,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:19:58,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:19:58,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:19:58,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:19:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:19:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:19:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:19:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:19:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:19:58,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:19:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:19:58,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:19:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:19:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:19:58,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:19:58,636 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:19:58,958 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:19:58,958 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:19:58,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:19:58 BoogieIcfgContainer [2019-12-07 18:19:58,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:19:58,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:19:58,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:19:58,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:19:58,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:19:58" (1/3) ... [2019-12-07 18:19:58,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232c94a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:19:58, skipping insertion in model container [2019-12-07 18:19:58,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:19:58" (2/3) ... [2019-12-07 18:19:58,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232c94a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:19:58, skipping insertion in model container [2019-12-07 18:19:58,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:19:58" (3/3) ... [2019-12-07 18:19:58,964 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.opt.i [2019-12-07 18:19:58,970 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:19:58,970 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:19:58,974 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:19:58,975 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:19:58,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:58,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:58,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:58,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:58,999 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:58,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:58,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:58,999 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:58,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,016 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,016 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,016 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,016 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:19:59,034 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 18:19:59,048 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:19:59,048 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:19:59,048 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:19:59,048 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:19:59,048 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:19:59,048 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:19:59,048 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:19:59,048 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:19:59,058 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-07 18:19:59,059 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-07 18:19:59,112 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-07 18:19:59,112 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:19:59,123 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 18:19:59,134 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-07 18:19:59,155 INFO L134 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-07 18:19:59,156 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:19:59,159 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 559 event pairs. 6/134 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 18:19:59,168 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 18:19:59,168 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:20:01,643 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 18:20:01,801 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-07 18:20:02,080 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-12-07 18:20:02,080 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-07 18:20:02,083 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-07 18:20:02,313 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-07 18:20:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-07 18:20:02,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 18:20:02,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:02,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 18:20:02,319 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:02,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:02,323 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-12-07 18:20:02,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:02,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29621118] [2019-12-07 18:20:02,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:02,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:02,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29621118] [2019-12-07 18:20:02,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:02,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:20:02,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162763462] [2019-12-07 18:20:02,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:02,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:02,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:02,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:02,489 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-07 18:20:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:02,646 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-12-07 18:20:02,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:02,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 18:20:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:02,697 INFO L225 Difference]: With dead ends: 6414 [2019-12-07 18:20:02,697 INFO L226 Difference]: Without dead ends: 6042 [2019-12-07 18:20:02,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-07 18:20:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-07 18:20:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-07 18:20:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-12-07 18:20:02,915 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-12-07 18:20:02,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:02,915 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-12-07 18:20:02,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:02,916 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-12-07 18:20:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:20:02,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:02,918 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:02,918 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:02,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:02,918 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-12-07 18:20:02,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:02,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965631213] [2019-12-07 18:20:02,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:02,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965631213] [2019-12-07 18:20:02,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:02,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:02,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788006735] [2019-12-07 18:20:02,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:02,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:02,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:02,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:02,979 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 4 states. [2019-12-07 18:20:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:03,223 INFO L93 Difference]: Finished difference Result 9128 states and 29363 transitions. [2019-12-07 18:20:03,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:20:03,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:20:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:03,285 INFO L225 Difference]: With dead ends: 9128 [2019-12-07 18:20:03,285 INFO L226 Difference]: Without dead ends: 9113 [2019-12-07 18:20:03,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9113 states. [2019-12-07 18:20:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9113 to 8369. [2019-12-07 18:20:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-12-07 18:20:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 27318 transitions. [2019-12-07 18:20:03,496 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 27318 transitions. Word has length 11 [2019-12-07 18:20:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:03,497 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 27318 transitions. [2019-12-07 18:20:03,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 27318 transitions. [2019-12-07 18:20:03,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:20:03,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:03,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:03,501 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:03,502 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-12-07 18:20:03,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:03,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691316621] [2019-12-07 18:20:03,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:03,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691316621] [2019-12-07 18:20:03,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:03,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:03,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797146191] [2019-12-07 18:20:03,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:03,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:03,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:03,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:03,536 INFO L87 Difference]: Start difference. First operand 8369 states and 27318 transitions. Second operand 3 states. [2019-12-07 18:20:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:03,609 INFO L93 Difference]: Finished difference Result 11252 states and 36788 transitions. [2019-12-07 18:20:03,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:03,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 18:20:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:03,638 INFO L225 Difference]: With dead ends: 11252 [2019-12-07 18:20:03,639 INFO L226 Difference]: Without dead ends: 11252 [2019-12-07 18:20:03,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:03,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11252 states. [2019-12-07 18:20:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11252 to 9819. [2019-12-07 18:20:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9819 states. [2019-12-07 18:20:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9819 states to 9819 states and 32327 transitions. [2019-12-07 18:20:03,879 INFO L78 Accepts]: Start accepts. Automaton has 9819 states and 32327 transitions. Word has length 14 [2019-12-07 18:20:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:03,880 INFO L462 AbstractCegarLoop]: Abstraction has 9819 states and 32327 transitions. [2019-12-07 18:20:03,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 9819 states and 32327 transitions. [2019-12-07 18:20:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:20:03,882 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:03,882 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:03,882 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:03,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:03,882 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-12-07 18:20:03,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:03,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181910342] [2019-12-07 18:20:03,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:03,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:03,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181910342] [2019-12-07 18:20:03,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:03,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:03,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718836126] [2019-12-07 18:20:03,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:03,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:03,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:03,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:03,922 INFO L87 Difference]: Start difference. First operand 9819 states and 32327 transitions. Second operand 4 states. [2019-12-07 18:20:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:04,049 INFO L93 Difference]: Finished difference Result 11915 states and 38297 transitions. [2019-12-07 18:20:04,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:20:04,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:20:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:04,072 INFO L225 Difference]: With dead ends: 11915 [2019-12-07 18:20:04,072 INFO L226 Difference]: Without dead ends: 11904 [2019-12-07 18:20:04,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 18:20:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11904 states. [2019-12-07 18:20:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11904 to 10744. [2019-12-07 18:20:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10744 states. [2019-12-07 18:20:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 35020 transitions. [2019-12-07 18:20:04,255 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 35020 transitions. Word has length 14 [2019-12-07 18:20:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:04,255 INFO L462 AbstractCegarLoop]: Abstraction has 10744 states and 35020 transitions. [2019-12-07 18:20:04,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:04,255 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 35020 transitions. [2019-12-07 18:20:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:20:04,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:04,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:04,257 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:04,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-12-07 18:20:04,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:04,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892460918] [2019-12-07 18:20:04,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:04,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892460918] [2019-12-07 18:20:04,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:04,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:04,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161021539] [2019-12-07 18:20:04,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:04,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:04,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:04,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:04,291 INFO L87 Difference]: Start difference. First operand 10744 states and 35020 transitions. Second operand 4 states. [2019-12-07 18:20:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:04,422 INFO L93 Difference]: Finished difference Result 12870 states and 41385 transitions. [2019-12-07 18:20:04,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:20:04,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 18:20:04,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:04,440 INFO L225 Difference]: With dead ends: 12870 [2019-12-07 18:20:04,440 INFO L226 Difference]: Without dead ends: 12857 [2019-12-07 18:20:04,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12857 states. [2019-12-07 18:20:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12857 to 10870. [2019-12-07 18:20:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10870 states. [2019-12-07 18:20:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10870 states to 10870 states and 35539 transitions. [2019-12-07 18:20:04,615 INFO L78 Accepts]: Start accepts. Automaton has 10870 states and 35539 transitions. Word has length 14 [2019-12-07 18:20:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:04,615 INFO L462 AbstractCegarLoop]: Abstraction has 10870 states and 35539 transitions. [2019-12-07 18:20:04,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 10870 states and 35539 transitions. [2019-12-07 18:20:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:20:04,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:04,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:04,618 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:04,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:04,618 INFO L82 PathProgramCache]: Analyzing trace with hash -133127032, now seen corresponding path program 1 times [2019-12-07 18:20:04,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:04,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441351507] [2019-12-07 18:20:04,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:04,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441351507] [2019-12-07 18:20:04,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:04,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:20:04,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304646031] [2019-12-07 18:20:04,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:04,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:04,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:04,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:04,678 INFO L87 Difference]: Start difference. First operand 10870 states and 35539 transitions. Second operand 3 states. [2019-12-07 18:20:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:04,742 INFO L93 Difference]: Finished difference Result 10914 states and 35611 transitions. [2019-12-07 18:20:04,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:04,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:20:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:04,755 INFO L225 Difference]: With dead ends: 10914 [2019-12-07 18:20:04,756 INFO L226 Difference]: Without dead ends: 10914 [2019-12-07 18:20:04,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10914 states. [2019-12-07 18:20:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10914 to 10867. [2019-12-07 18:20:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10867 states. [2019-12-07 18:20:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10867 states to 10867 states and 35530 transitions. [2019-12-07 18:20:04,909 INFO L78 Accepts]: Start accepts. Automaton has 10867 states and 35530 transitions. Word has length 16 [2019-12-07 18:20:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:04,910 INFO L462 AbstractCegarLoop]: Abstraction has 10867 states and 35530 transitions. [2019-12-07 18:20:04,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 10867 states and 35530 transitions. [2019-12-07 18:20:04,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:20:04,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:04,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:04,913 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:04,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:04,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1519842378, now seen corresponding path program 1 times [2019-12-07 18:20:04,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:04,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421014493] [2019-12-07 18:20:04,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:04,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:04,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421014493] [2019-12-07 18:20:04,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:04,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:20:04,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908045844] [2019-12-07 18:20:04,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:04,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:04,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:04,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:04,944 INFO L87 Difference]: Start difference. First operand 10867 states and 35530 transitions. Second operand 3 states. [2019-12-07 18:20:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:04,977 INFO L93 Difference]: Finished difference Result 10731 states and 35082 transitions. [2019-12-07 18:20:04,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:04,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 18:20:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:04,993 INFO L225 Difference]: With dead ends: 10731 [2019-12-07 18:20:04,994 INFO L226 Difference]: Without dead ends: 10731 [2019-12-07 18:20:04,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:05,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10731 states. [2019-12-07 18:20:05,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10731 to 10731. [2019-12-07 18:20:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10731 states. [2019-12-07 18:20:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10731 states to 10731 states and 35082 transitions. [2019-12-07 18:20:05,154 INFO L78 Accepts]: Start accepts. Automaton has 10731 states and 35082 transitions. Word has length 17 [2019-12-07 18:20:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:05,154 INFO L462 AbstractCegarLoop]: Abstraction has 10731 states and 35082 transitions. [2019-12-07 18:20:05,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 10731 states and 35082 transitions. [2019-12-07 18:20:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 18:20:05,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:05,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:05,158 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:05,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:05,158 INFO L82 PathProgramCache]: Analyzing trace with hash 319851597, now seen corresponding path program 1 times [2019-12-07 18:20:05,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:05,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725398246] [2019-12-07 18:20:05,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:05,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725398246] [2019-12-07 18:20:05,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:05,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:05,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461534725] [2019-12-07 18:20:05,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:05,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:05,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:05,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:05,206 INFO L87 Difference]: Start difference. First operand 10731 states and 35082 transitions. Second operand 4 states. [2019-12-07 18:20:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:05,245 INFO L93 Difference]: Finished difference Result 10756 states and 35098 transitions. [2019-12-07 18:20:05,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:05,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 18:20:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:05,257 INFO L225 Difference]: With dead ends: 10756 [2019-12-07 18:20:05,258 INFO L226 Difference]: Without dead ends: 10756 [2019-12-07 18:20:05,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-12-07 18:20:05,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 10709. [2019-12-07 18:20:05,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10709 states. [2019-12-07 18:20:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10709 states to 10709 states and 35017 transitions. [2019-12-07 18:20:05,404 INFO L78 Accepts]: Start accepts. Automaton has 10709 states and 35017 transitions. Word has length 17 [2019-12-07 18:20:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:05,404 INFO L462 AbstractCegarLoop]: Abstraction has 10709 states and 35017 transitions. [2019-12-07 18:20:05,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 10709 states and 35017 transitions. [2019-12-07 18:20:05,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:20:05,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:05,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:05,408 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash 22295755, now seen corresponding path program 1 times [2019-12-07 18:20:05,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:05,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414343971] [2019-12-07 18:20:05,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:05,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414343971] [2019-12-07 18:20:05,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:05,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:05,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851650465] [2019-12-07 18:20:05,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:05,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:05,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:05,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:05,430 INFO L87 Difference]: Start difference. First operand 10709 states and 35017 transitions. Second operand 3 states. [2019-12-07 18:20:05,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:05,441 INFO L93 Difference]: Finished difference Result 1657 states and 4053 transitions. [2019-12-07 18:20:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:05,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:20:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:05,443 INFO L225 Difference]: With dead ends: 1657 [2019-12-07 18:20:05,443 INFO L226 Difference]: Without dead ends: 1657 [2019-12-07 18:20:05,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2019-12-07 18:20:05,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2019-12-07 18:20:05,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657 states. [2019-12-07 18:20:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 4053 transitions. [2019-12-07 18:20:05,463 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 4053 transitions. Word has length 18 [2019-12-07 18:20:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:05,464 INFO L462 AbstractCegarLoop]: Abstraction has 1657 states and 4053 transitions. [2019-12-07 18:20:05,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 4053 transitions. [2019-12-07 18:20:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:20:05,466 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:05,466 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] [2019-12-07 18:20:05,466 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:05,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-12-07 18:20:05,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:05,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30627717] [2019-12-07 18:20:05,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:05,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30627717] [2019-12-07 18:20:05,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:05,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:05,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948932122] [2019-12-07 18:20:05,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:20:05,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:05,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:20:05,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:05,510 INFO L87 Difference]: Start difference. First operand 1657 states and 4053 transitions. Second operand 5 states. [2019-12-07 18:20:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:05,629 INFO L93 Difference]: Finished difference Result 2280 states and 5452 transitions. [2019-12-07 18:20:05,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:20:05,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 18:20:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:05,631 INFO L225 Difference]: With dead ends: 2280 [2019-12-07 18:20:05,631 INFO L226 Difference]: Without dead ends: 2278 [2019-12-07 18:20:05,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:20:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2019-12-07 18:20:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 1825. [2019-12-07 18:20:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2019-12-07 18:20:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 4429 transitions. [2019-12-07 18:20:05,653 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 4429 transitions. Word has length 26 [2019-12-07 18:20:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:05,654 INFO L462 AbstractCegarLoop]: Abstraction has 1825 states and 4429 transitions. [2019-12-07 18:20:05,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:20:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 4429 transitions. [2019-12-07 18:20:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:20:05,656 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:05,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:05,656 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash 225797087, now seen corresponding path program 1 times [2019-12-07 18:20:05,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:05,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680253002] [2019-12-07 18:20:05,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:05,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:05,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680253002] [2019-12-07 18:20:05,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:05,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:05,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948723617] [2019-12-07 18:20:05,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:20:05,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:20:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:05,708 INFO L87 Difference]: Start difference. First operand 1825 states and 4429 transitions. Second operand 5 states. [2019-12-07 18:20:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:05,868 INFO L93 Difference]: Finished difference Result 2285 states and 5459 transitions. [2019-12-07 18:20:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:20:05,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:20:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:05,870 INFO L225 Difference]: With dead ends: 2285 [2019-12-07 18:20:05,870 INFO L226 Difference]: Without dead ends: 2283 [2019-12-07 18:20:05,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:20:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2019-12-07 18:20:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 1679. [2019-12-07 18:20:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1679 states. [2019-12-07 18:20:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 4108 transitions. [2019-12-07 18:20:05,911 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 4108 transitions. Word has length 27 [2019-12-07 18:20:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:05,911 INFO L462 AbstractCegarLoop]: Abstraction has 1679 states and 4108 transitions. [2019-12-07 18:20:05,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:20:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 4108 transitions. [2019-12-07 18:20:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:20:05,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:05,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:05,913 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:05,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:05,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1541399368, now seen corresponding path program 1 times [2019-12-07 18:20:05,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:05,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468897606] [2019-12-07 18:20:05,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:05,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468897606] [2019-12-07 18:20:05,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:05,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:20:05,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952834404] [2019-12-07 18:20:05,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:20:05,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:20:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:05,961 INFO L87 Difference]: Start difference. First operand 1679 states and 4108 transitions. Second operand 5 states. [2019-12-07 18:20:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:06,195 INFO L93 Difference]: Finished difference Result 2493 states and 5966 transitions. [2019-12-07 18:20:06,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:20:06,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:20:06,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:06,197 INFO L225 Difference]: With dead ends: 2493 [2019-12-07 18:20:06,197 INFO L226 Difference]: Without dead ends: 2493 [2019-12-07 18:20:06,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:20:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-12-07 18:20:06,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2145. [2019-12-07 18:20:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-12-07 18:20:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 5161 transitions. [2019-12-07 18:20:06,216 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 5161 transitions. Word has length 27 [2019-12-07 18:20:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:06,216 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 5161 transitions. [2019-12-07 18:20:06,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:20:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 5161 transitions. [2019-12-07 18:20:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:20:06,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:06,218 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 18:20:06,218 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:06,219 INFO L82 PathProgramCache]: Analyzing trace with hash -144289883, now seen corresponding path program 1 times [2019-12-07 18:20:06,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:06,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382852574] [2019-12-07 18:20:06,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:06,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382852574] [2019-12-07 18:20:06,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:06,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:06,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999056194] [2019-12-07 18:20:06,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:06,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:06,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:06,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:06,261 INFO L87 Difference]: Start difference. First operand 2145 states and 5161 transitions. Second operand 4 states. [2019-12-07 18:20:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:06,278 INFO L93 Difference]: Finished difference Result 3648 states and 8864 transitions. [2019-12-07 18:20:06,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:06,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 18:20:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:06,279 INFO L225 Difference]: With dead ends: 3648 [2019-12-07 18:20:06,280 INFO L226 Difference]: Without dead ends: 1613 [2019-12-07 18:20:06,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:20:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2019-12-07 18:20:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2019-12-07 18:20:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2019-12-07 18:20:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 3949 transitions. [2019-12-07 18:20:06,293 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 3949 transitions. Word has length 28 [2019-12-07 18:20:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:06,293 INFO L462 AbstractCegarLoop]: Abstraction has 1613 states and 3949 transitions. [2019-12-07 18:20:06,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 3949 transitions. [2019-12-07 18:20:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:20:06,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:06,294 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 18:20:06,295 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:06,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:06,295 INFO L82 PathProgramCache]: Analyzing trace with hash -724042887, now seen corresponding path program 2 times [2019-12-07 18:20:06,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:06,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818493831] [2019-12-07 18:20:06,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:06,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818493831] [2019-12-07 18:20:06,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:06,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:20:06,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274740620] [2019-12-07 18:20:06,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:20:06,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:06,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:20:06,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:06,324 INFO L87 Difference]: Start difference. First operand 1613 states and 3949 transitions. Second operand 4 states. [2019-12-07 18:20:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:06,337 INFO L93 Difference]: Finished difference Result 754 states and 1710 transitions. [2019-12-07 18:20:06,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:20:06,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 18:20:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:06,338 INFO L225 Difference]: With dead ends: 754 [2019-12-07 18:20:06,339 INFO L226 Difference]: Without dead ends: 754 [2019-12-07 18:20:06,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:20:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-12-07 18:20:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 736. [2019-12-07 18:20:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-07 18:20:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1677 transitions. [2019-12-07 18:20:06,347 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1677 transitions. Word has length 28 [2019-12-07 18:20:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:06,348 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1677 transitions. [2019-12-07 18:20:06,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:20:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1677 transitions. [2019-12-07 18:20:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:20:06,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:06,349 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 18:20:06,349 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:06,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:06,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1541326249, now seen corresponding path program 1 times [2019-12-07 18:20:06,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:06,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829916552] [2019-12-07 18:20:06,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:06,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829916552] [2019-12-07 18:20:06,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:06,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:20:06,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138945062] [2019-12-07 18:20:06,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:20:06,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:20:06,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:20:06,408 INFO L87 Difference]: Start difference. First operand 736 states and 1677 transitions. Second operand 6 states. [2019-12-07 18:20:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:06,630 INFO L93 Difference]: Finished difference Result 859 states and 1923 transitions. [2019-12-07 18:20:06,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:20:06,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 18:20:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:06,631 INFO L225 Difference]: With dead ends: 859 [2019-12-07 18:20:06,631 INFO L226 Difference]: Without dead ends: 859 [2019-12-07 18:20:06,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:20:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-12-07 18:20:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 742. [2019-12-07 18:20:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-12-07 18:20:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1688 transitions. [2019-12-07 18:20:06,638 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1688 transitions. Word has length 41 [2019-12-07 18:20:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:06,638 INFO L462 AbstractCegarLoop]: Abstraction has 742 states and 1688 transitions. [2019-12-07 18:20:06,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:20:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1688 transitions. [2019-12-07 18:20:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:20:06,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:06,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:06,639 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:06,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1550772791, now seen corresponding path program 2 times [2019-12-07 18:20:06,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:06,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440852012] [2019-12-07 18:20:06,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:06,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440852012] [2019-12-07 18:20:06,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:06,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:20:06,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637329218] [2019-12-07 18:20:06,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:20:06,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:06,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:20:06,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:20:06,701 INFO L87 Difference]: Start difference. First operand 742 states and 1688 transitions. Second operand 7 states. [2019-12-07 18:20:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:06,812 INFO L93 Difference]: Finished difference Result 1224 states and 2710 transitions. [2019-12-07 18:20:06,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:20:06,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-07 18:20:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:06,813 INFO L225 Difference]: With dead ends: 1224 [2019-12-07 18:20:06,813 INFO L226 Difference]: Without dead ends: 797 [2019-12-07 18:20:06,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:20:06,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-12-07 18:20:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 753. [2019-12-07 18:20:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-07 18:20:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1693 transitions. [2019-12-07 18:20:06,819 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1693 transitions. Word has length 41 [2019-12-07 18:20:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:06,819 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1693 transitions. [2019-12-07 18:20:06,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:20:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1693 transitions. [2019-12-07 18:20:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:20:06,820 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:06,820 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 18:20:06,820 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1269710711, now seen corresponding path program 3 times [2019-12-07 18:20:06,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:06,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430817561] [2019-12-07 18:20:06,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:20:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:20:06,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430817561] [2019-12-07 18:20:06,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:20:06,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:20:06,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182046003] [2019-12-07 18:20:06,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:20:06,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:20:06,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:20:06,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:06,863 INFO L87 Difference]: Start difference. First operand 753 states and 1693 transitions. Second operand 3 states. [2019-12-07 18:20:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:20:06,871 INFO L93 Difference]: Finished difference Result 751 states and 1688 transitions. [2019-12-07 18:20:06,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:20:06,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 18:20:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:20:06,873 INFO L225 Difference]: With dead ends: 751 [2019-12-07 18:20:06,873 INFO L226 Difference]: Without dead ends: 751 [2019-12-07 18:20:06,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:20:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-12-07 18:20:06,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 695. [2019-12-07 18:20:06,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-12-07 18:20:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1581 transitions. [2019-12-07 18:20:06,879 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1581 transitions. Word has length 41 [2019-12-07 18:20:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:20:06,879 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1581 transitions. [2019-12-07 18:20:06,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:20:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1581 transitions. [2019-12-07 18:20:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:20:06,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:20:06,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:20:06,881 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:20:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:20:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 1 times [2019-12-07 18:20:06,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:20:06,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178880621] [2019-12-07 18:20:06,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:20:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:20:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:20:06,939 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:20:06,939 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:20:06,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t847~0.base_37|) (= v_~x~0_15 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37| 1)) (= v_~y$r_buff1_thd0~0_156 0) (= v_~y$w_buff1_used~0_428 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t847~0.base_37| 4)) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= 0 |v_ULTIMATE.start_main_~#t847~0.offset_26|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37|) |v_ULTIMATE.start_main_~#t847~0.offset_26| 0)) |v_#memory_int_15|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_23|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t847~0.base=|v_ULTIMATE.start_main_~#t847~0.base_37|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t847~0.offset=|v_ULTIMATE.start_main_~#t847~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t848~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t848~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t847~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t847~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:20:06,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t848~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t848~0.base_12|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t848~0.base_12| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t848~0.base_12|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12|) |v_ULTIMATE.start_main_~#t848~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_12|, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t848~0.base, ULTIMATE.start_main_~#t848~0.offset] because there is no mapped edge [2019-12-07 18:20:06,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~z~0_Out-1036618463 ~__unbuffered_p1_EAX~0_Out-1036618463) (= ~y$r_buff1_thd0~0_Out-1036618463 ~y$r_buff0_thd0~0_In-1036618463) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1036618463 0)) (= ~y$r_buff1_thd2~0_Out-1036618463 ~y$r_buff0_thd2~0_In-1036618463) (= ~__unbuffered_p1_EBX~0_Out-1036618463 ~a~0_In-1036618463) (= ~y$r_buff0_thd1~0_In-1036618463 ~y$r_buff1_thd1~0_Out-1036618463) (= 1 ~y$r_buff0_thd2~0_Out-1036618463) (= 1 ~z~0_Out-1036618463)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1036618463, ~a~0=~a~0_In-1036618463, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1036618463, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1036618463, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1036618463} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1036618463, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1036618463, ~a~0=~a~0_In-1036618463, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1036618463, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1036618463, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1036618463, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1036618463, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1036618463, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1036618463, ~z~0=~z~0_Out-1036618463, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1036618463} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:20:06,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1548498377 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1548498377 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out1548498377| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out1548498377| ~y$w_buff0_used~0_In1548498377)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1548498377, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1548498377} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1548498377, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1548498377, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1548498377|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:20:06,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-2010823807 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2010823807 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2010823807 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2010823807 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-2010823807|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-2010823807| ~y$w_buff1_used~0_In-2010823807) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2010823807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2010823807, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2010823807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2010823807} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2010823807, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2010823807|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2010823807, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2010823807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2010823807} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 18:20:06,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 18:20:06,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-591625247 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite23_In-591625247| |P0Thread1of1ForFork0_#t~ite23_Out-591625247|) (= |P0Thread1of1ForFork0_#t~ite24_Out-591625247| ~y$r_buff1_thd1~0_In-591625247)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-591625247 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-591625247 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-591625247 256)) (and (= (mod ~y$r_buff1_thd1~0_In-591625247 256) 0) .cse1))) .cse0 (= |P0Thread1of1ForFork0_#t~ite23_Out-591625247| ~y$r_buff1_thd1~0_In-591625247) (= |P0Thread1of1ForFork0_#t~ite23_Out-591625247| |P0Thread1of1ForFork0_#t~ite24_Out-591625247|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-591625247, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-591625247, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-591625247, ~weak$$choice2~0=~weak$$choice2~0_In-591625247, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-591625247, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-591625247|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-591625247, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-591625247, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-591625247, ~weak$$choice2~0=~weak$$choice2~0_In-591625247, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-591625247|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-591625247|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-591625247} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 18:20:06,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 18:20:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out-1592365713 ~y$r_buff0_thd2~0_In-1592365713)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1592365713 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1592365713 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd2~0_Out-1592365713 0) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1592365713, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1592365713} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1592365713|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1592365713, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1592365713} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 18:20:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In171292875 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In171292875 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In171292875 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In171292875 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In171292875 |P1Thread1of1ForFork1_#t~ite31_Out171292875|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out171292875|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In171292875, ~y$w_buff0_used~0=~y$w_buff0_used~0_In171292875, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In171292875, ~y$w_buff1_used~0=~y$w_buff1_used~0_In171292875} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In171292875, ~y$w_buff0_used~0=~y$w_buff0_used~0_In171292875, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out171292875|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In171292875, ~y$w_buff1_used~0=~y$w_buff1_used~0_In171292875} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:20:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 18:20:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:20:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-546346141 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-546346141 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-546346141 |ULTIMATE.start_main_#t~ite34_Out-546346141|) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-546346141 |ULTIMATE.start_main_#t~ite34_Out-546346141|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-546346141, ~y~0=~y~0_In-546346141, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-546346141, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-546346141} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-546346141, ~y~0=~y~0_In-546346141, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-546346141, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-546346141|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-546346141} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 18:20:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 18:20:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In886889159 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In886889159 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out886889159|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In886889159 |ULTIMATE.start_main_#t~ite36_Out886889159|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In886889159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In886889159} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In886889159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In886889159, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out886889159|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 18:20:06,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1194052941 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1194052941 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1194052941 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1194052941 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1194052941| ~y$w_buff1_used~0_In-1194052941) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite37_Out-1194052941| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1194052941, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1194052941, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1194052941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1194052941} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1194052941, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1194052941, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1194052941|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1194052941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1194052941} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 18:20:06,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In13297838 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In13297838 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out13297838| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out13297838| ~y$r_buff0_thd0~0_In13297838) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In13297838, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In13297838} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In13297838, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In13297838, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out13297838|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 18:20:06,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In475420353 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In475420353 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In475420353 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In475420353 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out475420353| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite39_Out475420353| ~y$r_buff1_thd0~0_In475420353)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In475420353, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In475420353, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In475420353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In475420353} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In475420353, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out475420353|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In475420353, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In475420353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In475420353} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 18:20:06,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:20:07,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:20:07 BasicIcfg [2019-12-07 18:20:07,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:20:07,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:20:07,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:20:07,002 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:20:07,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:19:58" (3/4) ... [2019-12-07 18:20:07,005 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:20:07,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t847~0.base_37|) (= v_~x~0_15 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37| 1)) (= v_~y$r_buff1_thd0~0_156 0) (= v_~y$w_buff1_used~0_428 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t847~0.base_37| 4)) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t847~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= 0 |v_ULTIMATE.start_main_~#t847~0.offset_26|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t847~0.base_37|) |v_ULTIMATE.start_main_~#t847~0.offset_26| 0)) |v_#memory_int_15|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_23|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t847~0.base=|v_ULTIMATE.start_main_~#t847~0.base_37|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t847~0.offset=|v_ULTIMATE.start_main_~#t847~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t848~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t848~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t847~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t847~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:20:07,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t848~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t848~0.base_12|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t848~0.base_12| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t848~0.base_12|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t848~0.base_12|) |v_ULTIMATE.start_main_~#t848~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t848~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t848~0.base=|v_ULTIMATE.start_main_~#t848~0.base_12|, ULTIMATE.start_main_~#t848~0.offset=|v_ULTIMATE.start_main_~#t848~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t848~0.base, ULTIMATE.start_main_~#t848~0.offset] because there is no mapped edge [2019-12-07 18:20:07,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~z~0_Out-1036618463 ~__unbuffered_p1_EAX~0_Out-1036618463) (= ~y$r_buff1_thd0~0_Out-1036618463 ~y$r_buff0_thd0~0_In-1036618463) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1036618463 0)) (= ~y$r_buff1_thd2~0_Out-1036618463 ~y$r_buff0_thd2~0_In-1036618463) (= ~__unbuffered_p1_EBX~0_Out-1036618463 ~a~0_In-1036618463) (= ~y$r_buff0_thd1~0_In-1036618463 ~y$r_buff1_thd1~0_Out-1036618463) (= 1 ~y$r_buff0_thd2~0_Out-1036618463) (= 1 ~z~0_Out-1036618463)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1036618463, ~a~0=~a~0_In-1036618463, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1036618463, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1036618463, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1036618463} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1036618463, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1036618463, ~a~0=~a~0_In-1036618463, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1036618463, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1036618463, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1036618463, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1036618463, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1036618463, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1036618463, ~z~0=~z~0_Out-1036618463, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1036618463} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 18:20:07,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1548498377 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1548498377 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out1548498377| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out1548498377| ~y$w_buff0_used~0_In1548498377)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1548498377, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1548498377} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1548498377, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1548498377, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1548498377|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 18:20:07,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-2010823807 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2010823807 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-2010823807 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2010823807 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out-2010823807|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-2010823807| ~y$w_buff1_used~0_In-2010823807) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2010823807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2010823807, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2010823807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2010823807} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2010823807, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2010823807|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2010823807, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2010823807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2010823807} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 18:20:07,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_7|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 18:20:07,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-591625247 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite23_In-591625247| |P0Thread1of1ForFork0_#t~ite23_Out-591625247|) (= |P0Thread1of1ForFork0_#t~ite24_Out-591625247| ~y$r_buff1_thd1~0_In-591625247)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-591625247 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-591625247 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-591625247 256)) (and (= (mod ~y$r_buff1_thd1~0_In-591625247 256) 0) .cse1))) .cse0 (= |P0Thread1of1ForFork0_#t~ite23_Out-591625247| ~y$r_buff1_thd1~0_In-591625247) (= |P0Thread1of1ForFork0_#t~ite23_Out-591625247| |P0Thread1of1ForFork0_#t~ite24_Out-591625247|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-591625247, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-591625247, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-591625247, ~weak$$choice2~0=~weak$$choice2~0_In-591625247, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-591625247, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-591625247|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-591625247, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-591625247, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-591625247, ~weak$$choice2~0=~weak$$choice2~0_In-591625247, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-591625247|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-591625247|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-591625247} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 18:20:07,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 18:20:07,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out-1592365713 ~y$r_buff0_thd2~0_In-1592365713)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1592365713 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1592365713 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd2~0_Out-1592365713 0) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1592365713, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1592365713} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1592365713|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1592365713, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1592365713} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 18:20:07,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In171292875 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In171292875 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In171292875 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In171292875 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In171292875 |P1Thread1of1ForFork1_#t~ite31_Out171292875|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out171292875|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In171292875, ~y$w_buff0_used~0=~y$w_buff0_used~0_In171292875, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In171292875, ~y$w_buff1_used~0=~y$w_buff1_used~0_In171292875} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In171292875, ~y$w_buff0_used~0=~y$w_buff0_used~0_In171292875, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out171292875|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In171292875, ~y$w_buff1_used~0=~y$w_buff1_used~0_In171292875} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 18:20:07,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite31_28| v_~y$r_buff1_thd2~0_59) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 18:20:07,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:20:07,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-546346141 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-546346141 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-546346141 |ULTIMATE.start_main_#t~ite34_Out-546346141|) (not .cse1)) (and (or .cse0 .cse1) (= ~y~0_In-546346141 |ULTIMATE.start_main_#t~ite34_Out-546346141|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-546346141, ~y~0=~y~0_In-546346141, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-546346141, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-546346141} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-546346141, ~y~0=~y~0_In-546346141, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-546346141, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-546346141|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-546346141} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 18:20:07,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 18:20:07,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In886889159 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In886889159 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out886889159|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In886889159 |ULTIMATE.start_main_#t~ite36_Out886889159|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In886889159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In886889159} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In886889159, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In886889159, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out886889159|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 18:20:07,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1194052941 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1194052941 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-1194052941 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1194052941 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1194052941| ~y$w_buff1_used~0_In-1194052941) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite37_Out-1194052941| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1194052941, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1194052941, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1194052941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1194052941} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1194052941, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1194052941, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1194052941|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1194052941, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1194052941} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 18:20:07,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In13297838 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In13297838 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out13297838| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out13297838| ~y$r_buff0_thd0~0_In13297838) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In13297838, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In13297838} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In13297838, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In13297838, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out13297838|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 18:20:07,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In475420353 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In475420353 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In475420353 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In475420353 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out475420353| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite39_Out475420353| ~y$r_buff1_thd0~0_In475420353)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In475420353, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In475420353, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In475420353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In475420353} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In475420353, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out475420353|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In475420353, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In475420353, ~y$w_buff1_used~0=~y$w_buff1_used~0_In475420353} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 18:20:07,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= 1 v_~__unbuffered_p0_EAX~0_21))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:20:07,072 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_85e1602f-8bf1-43cf-a98b-001189c3fbcc/bin/uautomizer/witness.graphml [2019-12-07 18:20:07,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:20:07,074 INFO L168 Benchmark]: Toolchain (without parser) took 8919.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 449.3 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -113.7 MB). Peak memory consumption was 335.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:07,074 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:20:07,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:07,075 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.84 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 18:20:07,075 INFO L168 Benchmark]: Boogie Preprocessor took 23.79 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:07,075 INFO L168 Benchmark]: RCFGBuilder took 366.38 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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:07,076 INFO L168 Benchmark]: TraceAbstraction took 8042.59 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 320.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -32.6 MB). Peak memory consumption was 288.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:07,076 INFO L168 Benchmark]: Witness Printer took 70.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:20:07,078 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 376.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.84 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.79 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 366.38 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: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8042.59 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 320.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -32.6 MB). Peak memory consumption was 288.3 MB. Max. memory is 11.5 GB. * Witness Printer took 70.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t847, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t848, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L818] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1914 SDtfs, 1428 SDslu, 2899 SDs, 0 SdLazy, 1494 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10870occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 7058 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 427 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 368 ConstructedInterpolants, 0 QuantifiedInterpolants, 41378 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...