./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe022_power.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_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/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 d6d1b0f8d97c0ebf25f5e99293c7fed6b2817ad3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:29:38,115 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:29:38,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:29:38,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:29:38,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:29:38,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:29:38,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:29:38,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:29:38,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:29:38,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:29:38,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:29:38,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:29:38,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:29:38,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:29:38,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:29:38,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:29:38,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:29:38,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:29:38,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:29:38,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:29:38,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:29:38,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:29:38,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:29:38,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:29:38,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:29:38,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:29:38,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:29:38,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:29:38,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:29:38,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:29:38,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:29:38,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:29:38,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:29:38,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:29:38,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:29:38,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:29:38,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:29:38,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:29:38,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:29:38,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:29:38,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:29:38,147 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:29:38,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:29:38,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:29:38,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:29:38,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:29:38,157 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:29:38,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:29:38,157 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:29:38,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:29:38,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:29:38,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:29:38,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:29:38,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:29:38,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:29:38,158 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:29:38,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:29:38,158 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:29:38,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:29:38,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:29:38,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:29:38,159 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:29:38,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:29:38,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:29:38,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:29:38,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:29:38,160 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:29:38,160 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:29:38,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:29:38,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:29:38,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:29:38,160 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_b80ad577-af60-45a7-b2ef-887c323ce31c/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 -> d6d1b0f8d97c0ebf25f5e99293c7fed6b2817ad3 [2019-12-07 17:29:38,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:29:38,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:29:38,273 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:29:38,274 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:29:38,274 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:29:38,275 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe022_power.opt.i [2019-12-07 17:29:38,313 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/data/155484752/fb1b446c2634423a89aa6ef5034ea0f1/FLAG4d3d8f9fa [2019-12-07 17:29:38,838 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:29:38,838 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/sv-benchmarks/c/pthread-wmm/safe022_power.opt.i [2019-12-07 17:29:38,849 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/data/155484752/fb1b446c2634423a89aa6ef5034ea0f1/FLAG4d3d8f9fa [2019-12-07 17:29:39,344 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/data/155484752/fb1b446c2634423a89aa6ef5034ea0f1 [2019-12-07 17:29:39,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:29:39,348 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:29:39,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:29:39,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:29:39,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:29:39,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:29:39" (1/1) ... [2019-12-07 17:29:39,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73480b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39, skipping insertion in model container [2019-12-07 17:29:39,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:29:39" (1/1) ... [2019-12-07 17:29:39,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:29:39,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:29:39,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:29:39,643 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:29:39,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:29:39,743 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:29:39,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39 WrapperNode [2019-12-07 17:29:39,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:29:39,744 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:29:39,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:29:39,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:29:39,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39" (1/1) ... [2019-12-07 17:29:39,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39" (1/1) ... [2019-12-07 17:29:39,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:29:39,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:29:39,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:29:39,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:29:39,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39" (1/1) ... [2019-12-07 17:29:39,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39" (1/1) ... [2019-12-07 17:29:39,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39" (1/1) ... [2019-12-07 17:29:39,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39" (1/1) ... [2019-12-07 17:29:39,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39" (1/1) ... [2019-12-07 17:29:39,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39" (1/1) ... [2019-12-07 17:29:39,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39" (1/1) ... [2019-12-07 17:29:39,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:29:39,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:29:39,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:29:39,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:29:39,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:29:39,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:29:39,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:29:39,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:29:39,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:29:39,864 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:29:39,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:29:39,865 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:29:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:29:39,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:29:39,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:29:39,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:29:39,866 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:29:40,201 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:29:40,202 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:29:40,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:29:40 BoogieIcfgContainer [2019-12-07 17:29:40,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:29:40,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:29:40,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:29:40,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:29:40,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:29:39" (1/3) ... [2019-12-07 17:29:40,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462d3903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:29:40, skipping insertion in model container [2019-12-07 17:29:40,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:29:39" (2/3) ... [2019-12-07 17:29:40,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@462d3903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:29:40, skipping insertion in model container [2019-12-07 17:29:40,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:29:40" (3/3) ... [2019-12-07 17:29:40,207 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_power.opt.i [2019-12-07 17:29:40,213 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:29:40,213 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:29:40,218 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:29:40,218 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:29:40,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,241 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,241 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,241 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,241 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,241 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,248 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:29:40,276 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:29:40,288 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:29:40,289 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:29:40,289 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:29:40,289 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:29:40,289 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:29:40,289 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:29:40,289 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:29:40,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:29:40,299 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 17:29:40,300 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:29:40,348 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:29:40,348 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:29:40,356 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:29:40,368 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:29:40,393 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:29:40,393 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:29:40,396 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:29:40,406 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:29:40,407 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:29:43,013 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 17:29:43,122 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-07 17:29:43,122 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-07 17:29:43,124 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 17:29:43,436 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-07 17:29:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-07 17:29:43,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:29:43,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:43,443 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:29:43,443 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:43,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:43,447 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-07 17:29:43,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:43,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671447085] [2019-12-07 17:29:43,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:43,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671447085] [2019-12-07 17:29:43,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:43,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:29:43,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432875135] [2019-12-07 17:29:43,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:43,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:43,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:43,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:43,601 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-07 17:29:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:43,779 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-07 17:29:43,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:43,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:29:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:43,840 INFO L225 Difference]: With dead ends: 8074 [2019-12-07 17:29:43,840 INFO L226 Difference]: Without dead ends: 7606 [2019-12-07 17:29:43,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-07 17:29:44,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-07 17:29:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-07 17:29:44,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-07 17:29:44,113 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-07 17:29:44,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:44,113 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-07 17:29:44,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:44,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-07 17:29:44,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:29:44,116 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:44,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:44,117 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:44,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:44,117 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-07 17:29:44,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:44,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090922570] [2019-12-07 17:29:44,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:44,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090922570] [2019-12-07 17:29:44,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:44,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:29:44,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188822959] [2019-12-07 17:29:44,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:44,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:44,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:44,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:44,200 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-07 17:29:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:44,465 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-07 17:29:44,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:29:44,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:29:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:44,525 INFO L225 Difference]: With dead ends: 11630 [2019-12-07 17:29:44,525 INFO L226 Difference]: Without dead ends: 11623 [2019-12-07 17:29:44,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:44,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-07 17:29:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-07 17:29:44,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-07 17:29:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-07 17:29:44,809 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-07 17:29:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:44,809 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-07 17:29:44,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-07 17:29:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:29:44,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:44,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:44,814 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:44,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-07 17:29:44,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:44,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766298890] [2019-12-07 17:29:44,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:44,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766298890] [2019-12-07 17:29:44,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:44,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:44,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220381746] [2019-12-07 17:29:44,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:44,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:44,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:44,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:44,866 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-07 17:29:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:45,124 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-07 17:29:45,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:29:45,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 17:29:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:45,153 INFO L225 Difference]: With dead ends: 14471 [2019-12-07 17:29:45,153 INFO L226 Difference]: Without dead ends: 14471 [2019-12-07 17:29:45,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:29:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-07 17:29:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-07 17:29:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-07 17:29:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-07 17:29:45,391 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-07 17:29:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:45,391 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-07 17:29:45,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:45,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-07 17:29:45,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:29:45,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:45,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:45,394 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:45,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-07 17:29:45,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:45,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79205578] [2019-12-07 17:29:45,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:45,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79205578] [2019-12-07 17:29:45,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:45,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:29:45,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796501133] [2019-12-07 17:29:45,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:45,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:45,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:45,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:45,450 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-07 17:29:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:45,486 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-07 17:29:45,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:45,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:29:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:45,504 INFO L225 Difference]: With dead ends: 10750 [2019-12-07 17:29:45,504 INFO L226 Difference]: Without dead ends: 10750 [2019-12-07 17:29:45,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-07 17:29:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-07 17:29:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-07 17:29:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-07 17:29:45,717 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-07 17:29:45,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:45,717 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-07 17:29:45,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-07 17:29:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:29:45,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:45,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:45,720 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:45,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-07 17:29:45,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:45,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481029708] [2019-12-07 17:29:45,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:45,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481029708] [2019-12-07 17:29:45,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:45,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:29:45,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642321273] [2019-12-07 17:29:45,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:45,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:45,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:45,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:45,777 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 3 states. [2019-12-07 17:29:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:45,808 INFO L93 Difference]: Finished difference Result 10710 states and 33130 transitions. [2019-12-07 17:29:45,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:45,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:29:45,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:45,823 INFO L225 Difference]: With dead ends: 10710 [2019-12-07 17:29:45,823 INFO L226 Difference]: Without dead ends: 10710 [2019-12-07 17:29:45,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10710 states. [2019-12-07 17:29:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10710 to 10645. [2019-12-07 17:29:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10645 states. [2019-12-07 17:29:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10645 states to 10645 states and 33030 transitions. [2019-12-07 17:29:45,988 INFO L78 Accepts]: Start accepts. Automaton has 10645 states and 33030 transitions. Word has length 16 [2019-12-07 17:29:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:45,988 INFO L462 AbstractCegarLoop]: Abstraction has 10645 states and 33030 transitions. [2019-12-07 17:29:45,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 10645 states and 33030 transitions. [2019-12-07 17:29:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:29:45,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:45,991 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:45,991 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:45,991 INFO L82 PathProgramCache]: Analyzing trace with hash -680515989, now seen corresponding path program 1 times [2019-12-07 17:29:45,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:45,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794895468] [2019-12-07 17:29:45,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:46,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794895468] [2019-12-07 17:29:46,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:46,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:29:46,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919043777] [2019-12-07 17:29:46,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:46,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:46,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:46,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:46,031 INFO L87 Difference]: Start difference. First operand 10645 states and 33030 transitions. Second operand 4 states. [2019-12-07 17:29:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:46,090 INFO L93 Difference]: Finished difference Result 15274 states and 47713 transitions. [2019-12-07 17:29:46,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:29:46,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 17:29:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:46,109 INFO L225 Difference]: With dead ends: 15274 [2019-12-07 17:29:46,109 INFO L226 Difference]: Without dead ends: 15274 [2019-12-07 17:29:46,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:46,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15274 states. [2019-12-07 17:29:46,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15274 to 15237. [2019-12-07 17:29:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15237 states. [2019-12-07 17:29:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15237 states to 15237 states and 47658 transitions. [2019-12-07 17:29:46,372 INFO L78 Accepts]: Start accepts. Automaton has 15237 states and 47658 transitions. Word has length 17 [2019-12-07 17:29:46,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:46,373 INFO L462 AbstractCegarLoop]: Abstraction has 15237 states and 47658 transitions. [2019-12-07 17:29:46,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:46,373 INFO L276 IsEmpty]: Start isEmpty. Operand 15237 states and 47658 transitions. [2019-12-07 17:29:46,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:29:46,377 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:46,377 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:46,377 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:46,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:46,378 INFO L82 PathProgramCache]: Analyzing trace with hash 800753806, now seen corresponding path program 1 times [2019-12-07 17:29:46,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:46,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603384842] [2019-12-07 17:29:46,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:46,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603384842] [2019-12-07 17:29:46,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:46,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:46,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836225928] [2019-12-07 17:29:46,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:46,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:46,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:46,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:46,423 INFO L87 Difference]: Start difference. First operand 15237 states and 47658 transitions. Second operand 4 states. [2019-12-07 17:29:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:46,448 INFO L93 Difference]: Finished difference Result 2805 states and 7141 transitions. [2019-12-07 17:29:46,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:46,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 17:29:46,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:46,450 INFO L225 Difference]: With dead ends: 2805 [2019-12-07 17:29:46,450 INFO L226 Difference]: Without dead ends: 1955 [2019-12-07 17:29:46,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:46,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states. [2019-12-07 17:29:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1955. [2019-12-07 17:29:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1955 states. [2019-12-07 17:29:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 4404 transitions. [2019-12-07 17:29:46,468 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 4404 transitions. Word has length 19 [2019-12-07 17:29:46,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:46,468 INFO L462 AbstractCegarLoop]: Abstraction has 1955 states and 4404 transitions. [2019-12-07 17:29:46,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:46,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 4404 transitions. [2019-12-07 17:29:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:29:46,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:46,470 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] [2019-12-07 17:29:46,470 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:46,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:46,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-07 17:29:46,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:46,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941193883] [2019-12-07 17:29:46,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:46,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941193883] [2019-12-07 17:29:46,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:46,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:46,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398098861] [2019-12-07 17:29:46,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:29:46,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:46,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:29:46,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:29:46,532 INFO L87 Difference]: Start difference. First operand 1955 states and 4404 transitions. Second operand 6 states. [2019-12-07 17:29:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:46,799 INFO L93 Difference]: Finished difference Result 2745 states and 5950 transitions. [2019-12-07 17:29:46,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:29:46,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 17:29:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:46,801 INFO L225 Difference]: With dead ends: 2745 [2019-12-07 17:29:46,801 INFO L226 Difference]: Without dead ends: 2693 [2019-12-07 17:29:46,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:29:46,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2019-12-07 17:29:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 1926. [2019-12-07 17:29:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-12-07 17:29:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 4340 transitions. [2019-12-07 17:29:46,826 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 4340 transitions. Word has length 24 [2019-12-07 17:29:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:46,826 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 4340 transitions. [2019-12-07 17:29:46,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:29:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 4340 transitions. [2019-12-07 17:29:46,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:29:46,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:46,828 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 17:29:46,828 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:46,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-07 17:29:46,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:46,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315833506] [2019-12-07 17:29:46,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:46,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315833506] [2019-12-07 17:29:46,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:46,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:29:46,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973497659] [2019-12-07 17:29:46,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:46,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:46,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:46,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:46,892 INFO L87 Difference]: Start difference. First operand 1926 states and 4340 transitions. Second operand 5 states. [2019-12-07 17:29:46,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:46,924 INFO L93 Difference]: Finished difference Result 1028 states and 2299 transitions. [2019-12-07 17:29:46,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:29:46,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 17:29:46,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:46,926 INFO L225 Difference]: With dead ends: 1028 [2019-12-07 17:29:46,926 INFO L226 Difference]: Without dead ends: 942 [2019-12-07 17:29:46,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:29:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-12-07 17:29:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 689. [2019-12-07 17:29:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-07 17:29:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-07 17:29:46,936 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 28 [2019-12-07 17:29:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:46,937 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-07 17:29:46,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-07 17:29:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:29:46,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:46,939 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:46,939 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:46,939 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-07 17:29:46,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:46,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396473068] [2019-12-07 17:29:46,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:47,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396473068] [2019-12-07 17:29:47,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:47,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:29:47,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045766887] [2019-12-07 17:29:47,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:47,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:47,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:47,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:47,005 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 5 states. [2019-12-07 17:29:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:47,215 INFO L93 Difference]: Finished difference Result 1105 states and 2341 transitions. [2019-12-07 17:29:47,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:29:47,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 17:29:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:47,217 INFO L225 Difference]: With dead ends: 1105 [2019-12-07 17:29:47,217 INFO L226 Difference]: Without dead ends: 1105 [2019-12-07 17:29:47,217 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 17:29:47,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-12-07 17:29:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 896. [2019-12-07 17:29:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-12-07 17:29:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1944 transitions. [2019-12-07 17:29:47,229 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1944 transitions. Word has length 51 [2019-12-07 17:29:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:47,230 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1944 transitions. [2019-12-07 17:29:47,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:47,230 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1944 transitions. [2019-12-07 17:29:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:29:47,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:47,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:47,232 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:47,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:47,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1015680243, now seen corresponding path program 2 times [2019-12-07 17:29:47,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:47,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231526867] [2019-12-07 17:29:47,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:47,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231526867] [2019-12-07 17:29:47,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:47,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:29:47,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113921521] [2019-12-07 17:29:47,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:47,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:47,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:47,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:47,286 INFO L87 Difference]: Start difference. First operand 896 states and 1944 transitions. Second operand 3 states. [2019-12-07 17:29:47,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:47,322 INFO L93 Difference]: Finished difference Result 1184 states and 2559 transitions. [2019-12-07 17:29:47,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:47,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 17:29:47,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:47,323 INFO L225 Difference]: With dead ends: 1184 [2019-12-07 17:29:47,323 INFO L226 Difference]: Without dead ends: 1184 [2019-12-07 17:29:47,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:47,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-12-07 17:29:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 956. [2019-12-07 17:29:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-07 17:29:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-12-07 17:29:47,331 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-12-07 17:29:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:47,332 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-12-07 17:29:47,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-12-07 17:29:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:47,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:47,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:47,333 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:47,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:47,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-12-07 17:29:47,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:47,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328585179] [2019-12-07 17:29:47,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:47,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328585179] [2019-12-07 17:29:47,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:47,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:47,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380175718] [2019-12-07 17:29:47,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:47,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:47,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:47,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:47,407 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 5 states. [2019-12-07 17:29:47,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:47,422 INFO L93 Difference]: Finished difference Result 1646 states and 3628 transitions. [2019-12-07 17:29:47,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:47,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 17:29:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:47,423 INFO L225 Difference]: With dead ends: 1646 [2019-12-07 17:29:47,423 INFO L226 Difference]: Without dead ends: 759 [2019-12-07 17:29:47,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:29:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-12-07 17:29:47,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-12-07 17:29:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-07 17:29:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1666 transitions. [2019-12-07 17:29:47,430 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1666 transitions. Word has length 52 [2019-12-07 17:29:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:47,430 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1666 transitions. [2019-12-07 17:29:47,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1666 transitions. [2019-12-07 17:29:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:47,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:47,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:47,431 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:47,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:47,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 2 times [2019-12-07 17:29:47,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:47,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149915379] [2019-12-07 17:29:47,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:47,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149915379] [2019-12-07 17:29:47,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:47,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 17:29:47,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331626502] [2019-12-07 17:29:47,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:29:47,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:47,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:29:47,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:29:47,647 INFO L87 Difference]: Start difference. First operand 759 states and 1666 transitions. Second operand 13 states. [2019-12-07 17:29:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:48,433 INFO L93 Difference]: Finished difference Result 1086 states and 2309 transitions. [2019-12-07 17:29:48,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 17:29:48,434 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 17:29:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:48,435 INFO L225 Difference]: With dead ends: 1086 [2019-12-07 17:29:48,435 INFO L226 Difference]: Without dead ends: 865 [2019-12-07 17:29:48,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:29:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-12-07 17:29:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 790. [2019-12-07 17:29:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-12-07 17:29:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1740 transitions. [2019-12-07 17:29:48,462 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1740 transitions. Word has length 52 [2019-12-07 17:29:48,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:48,462 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1740 transitions. [2019-12-07 17:29:48,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:29:48,462 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1740 transitions. [2019-12-07 17:29:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:48,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:48,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:48,463 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:48,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:48,463 INFO L82 PathProgramCache]: Analyzing trace with hash 925896582, now seen corresponding path program 3 times [2019-12-07 17:29:48,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:48,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286522627] [2019-12-07 17:29:48,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:48,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286522627] [2019-12-07 17:29:48,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:48,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 17:29:48,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134063977] [2019-12-07 17:29:48,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:29:48,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:48,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:29:48,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:29:48,898 INFO L87 Difference]: Start difference. First operand 790 states and 1740 transitions. Second operand 18 states. [2019-12-07 17:29:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:50,135 INFO L93 Difference]: Finished difference Result 1125 states and 2352 transitions. [2019-12-07 17:29:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 17:29:50,136 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-12-07 17:29:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:50,137 INFO L225 Difference]: With dead ends: 1125 [2019-12-07 17:29:50,137 INFO L226 Difference]: Without dead ends: 822 [2019-12-07 17:29:50,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1273, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 17:29:50,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-07 17:29:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 786. [2019-12-07 17:29:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-12-07 17:29:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1712 transitions. [2019-12-07 17:29:50,144 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1712 transitions. Word has length 52 [2019-12-07 17:29:50,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:50,144 INFO L462 AbstractCegarLoop]: Abstraction has 786 states and 1712 transitions. [2019-12-07 17:29:50,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:29:50,144 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1712 transitions. [2019-12-07 17:29:50,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:50,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:50,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:50,145 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:50,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:50,145 INFO L82 PathProgramCache]: Analyzing trace with hash -514676127, now seen corresponding path program 1 times [2019-12-07 17:29:50,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:50,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72724131] [2019-12-07 17:29:50,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:50,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72724131] [2019-12-07 17:29:50,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:50,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:29:50,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542954882] [2019-12-07 17:29:50,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:29:50,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:50,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:29:50,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:50,177 INFO L87 Difference]: Start difference. First operand 786 states and 1712 transitions. Second operand 3 states. [2019-12-07 17:29:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:50,206 INFO L93 Difference]: Finished difference Result 1087 states and 2341 transitions. [2019-12-07 17:29:50,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:29:50,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:29:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:50,207 INFO L225 Difference]: With dead ends: 1087 [2019-12-07 17:29:50,207 INFO L226 Difference]: Without dead ends: 1087 [2019-12-07 17:29:50,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:29:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2019-12-07 17:29:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 881. [2019-12-07 17:29:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-12-07 17:29:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1928 transitions. [2019-12-07 17:29:50,216 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1928 transitions. Word has length 52 [2019-12-07 17:29:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:50,217 INFO L462 AbstractCegarLoop]: Abstraction has 881 states and 1928 transitions. [2019-12-07 17:29:50,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:29:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1928 transitions. [2019-12-07 17:29:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:50,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:50,218 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:50,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1936958090, now seen corresponding path program 4 times [2019-12-07 17:29:50,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:50,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212640488] [2019-12-07 17:29:50,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:50,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212640488] [2019-12-07 17:29:50,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:50,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 17:29:50,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914023952] [2019-12-07 17:29:50,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:29:50,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:50,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:29:50,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:29:50,421 INFO L87 Difference]: Start difference. First operand 881 states and 1928 transitions. Second operand 14 states. [2019-12-07 17:29:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:50,922 INFO L93 Difference]: Finished difference Result 1100 states and 2333 transitions. [2019-12-07 17:29:50,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:29:50,923 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-12-07 17:29:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:50,923 INFO L225 Difference]: With dead ends: 1100 [2019-12-07 17:29:50,923 INFO L226 Difference]: Without dead ends: 971 [2019-12-07 17:29:50,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:29:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-12-07 17:29:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 875. [2019-12-07 17:29:50,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-12-07 17:29:50,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1908 transitions. [2019-12-07 17:29:50,931 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1908 transitions. Word has length 52 [2019-12-07 17:29:50,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:50,931 INFO L462 AbstractCegarLoop]: Abstraction has 875 states and 1908 transitions. [2019-12-07 17:29:50,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:29:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1908 transitions. [2019-12-07 17:29:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:50,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:50,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:50,932 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:50,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1641960426, now seen corresponding path program 5 times [2019-12-07 17:29:50,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:50,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713938330] [2019-12-07 17:29:50,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:51,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713938330] [2019-12-07 17:29:51,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:51,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:29:51,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414768578] [2019-12-07 17:29:51,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:29:51,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:51,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:29:51,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:29:51,073 INFO L87 Difference]: Start difference. First operand 875 states and 1908 transitions. Second operand 10 states. [2019-12-07 17:29:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:51,594 INFO L93 Difference]: Finished difference Result 1218 states and 2591 transitions. [2019-12-07 17:29:51,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 17:29:51,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-07 17:29:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:51,596 INFO L225 Difference]: With dead ends: 1218 [2019-12-07 17:29:51,596 INFO L226 Difference]: Without dead ends: 918 [2019-12-07 17:29:51,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:29:51,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-12-07 17:29:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2019-12-07 17:29:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2019-12-07 17:29:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1988 transitions. [2019-12-07 17:29:51,603 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1988 transitions. Word has length 52 [2019-12-07 17:29:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:51,603 INFO L462 AbstractCegarLoop]: Abstraction has 918 states and 1988 transitions. [2019-12-07 17:29:51,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:29:51,603 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1988 transitions. [2019-12-07 17:29:51,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:51,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:51,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:51,604 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:51,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:51,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1509998510, now seen corresponding path program 6 times [2019-12-07 17:29:51,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:51,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875523100] [2019-12-07 17:29:51,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:51,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875523100] [2019-12-07 17:29:51,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:51,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:29:51,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650918712] [2019-12-07 17:29:51,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:29:51,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:51,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:29:51,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:29:51,764 INFO L87 Difference]: Start difference. First operand 918 states and 1988 transitions. Second operand 12 states. [2019-12-07 17:29:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:52,308 INFO L93 Difference]: Finished difference Result 1281 states and 2716 transitions. [2019-12-07 17:29:52,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 17:29:52,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-12-07 17:29:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:52,309 INFO L225 Difference]: With dead ends: 1281 [2019-12-07 17:29:52,310 INFO L226 Difference]: Without dead ends: 859 [2019-12-07 17:29:52,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:29:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-12-07 17:29:52,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 847. [2019-12-07 17:29:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-12-07 17:29:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1825 transitions. [2019-12-07 17:29:52,316 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1825 transitions. Word has length 52 [2019-12-07 17:29:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:52,317 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1825 transitions. [2019-12-07 17:29:52,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:29:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1825 transitions. [2019-12-07 17:29:52,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:52,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:52,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:52,318 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:52,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:52,318 INFO L82 PathProgramCache]: Analyzing trace with hash -888843222, now seen corresponding path program 7 times [2019-12-07 17:29:52,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:52,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535512775] [2019-12-07 17:29:52,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:52,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:52,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535512775] [2019-12-07 17:29:52,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:52,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 17:29:52,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888267014] [2019-12-07 17:29:52,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:29:52,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:52,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:29:52,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:29:52,518 INFO L87 Difference]: Start difference. First operand 847 states and 1825 transitions. Second operand 13 states. [2019-12-07 17:29:52,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:52,986 INFO L93 Difference]: Finished difference Result 1136 states and 2392 transitions. [2019-12-07 17:29:52,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 17:29:52,987 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 17:29:52,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:52,987 INFO L225 Difference]: With dead ends: 1136 [2019-12-07 17:29:52,987 INFO L226 Difference]: Without dead ends: 845 [2019-12-07 17:29:52,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:29:52,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-12-07 17:29:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2019-12-07 17:29:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-12-07 17:29:52,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1821 transitions. [2019-12-07 17:29:52,994 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1821 transitions. Word has length 52 [2019-12-07 17:29:52,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:52,994 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1821 transitions. [2019-12-07 17:29:52,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:29:52,994 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1821 transitions. [2019-12-07 17:29:52,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:52,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:52,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:52,995 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:52,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1384485644, now seen corresponding path program 8 times [2019-12-07 17:29:52,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:52,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364721787] [2019-12-07 17:29:52,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:53,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364721787] [2019-12-07 17:29:53,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:53,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:29:53,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365133318] [2019-12-07 17:29:53,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:29:53,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:29:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:29:53,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:29:53,040 INFO L87 Difference]: Start difference. First operand 845 states and 1821 transitions. Second operand 7 states. [2019-12-07 17:29:53,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:53,129 INFO L93 Difference]: Finished difference Result 1363 states and 2864 transitions. [2019-12-07 17:29:53,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:29:53,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 17:29:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:53,130 INFO L225 Difference]: With dead ends: 1363 [2019-12-07 17:29:53,130 INFO L226 Difference]: Without dead ends: 970 [2019-12-07 17:29:53,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:29:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-12-07 17:29:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 805. [2019-12-07 17:29:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-07 17:29:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1738 transitions. [2019-12-07 17:29:53,137 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1738 transitions. Word has length 52 [2019-12-07 17:29:53,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:53,137 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1738 transitions. [2019-12-07 17:29:53,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:29:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1738 transitions. [2019-12-07 17:29:53,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:29:53,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:53,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:53,139 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:53,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:53,139 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 9 times [2019-12-07 17:29:53,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:29:53,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782601747] [2019-12-07 17:29:53,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:29:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:29:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:29:53,197 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:29:53,197 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:29:53,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= v_~y$r_buff1_thd0~0_129 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2307~0.base_48|) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48|) |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48| 1) |v_#valid_73|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48|)) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_49|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ULTIMATE.start_main_~#t2307~0.offset=|v_ULTIMATE.start_main_~#t2307~0.offset_31|, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2307~0.base=|v_ULTIMATE.start_main_~#t2307~0.base_48|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_31|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2308~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2307~0.offset, ~y$mem_tmp~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, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2307~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~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, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2308~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:29:53,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2308~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2308~0.base_13|)) (= |v_ULTIMATE.start_main_~#t2308~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13|) |v_ULTIMATE.start_main_~#t2308~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2308~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2308~0.offset] because there is no mapped edge [2019-12-07 17:29:53,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= 1 ~y$r_buff0_thd1~0_Out-591591800) (= ~y$r_buff1_thd2~0_Out-591591800 ~y$r_buff0_thd2~0_In-591591800) (= ~y$r_buff1_thd1~0_Out-591591800 ~y$r_buff0_thd1~0_In-591591800) (= 1 ~x~0_Out-591591800) (= ~y$r_buff0_thd0~0_In-591591800 ~y$r_buff1_thd0~0_Out-591591800) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-591591800))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-591591800, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-591591800, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-591591800, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-591591800} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-591591800, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-591591800, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-591591800, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-591591800, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-591591800, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-591591800, ~x~0=~x~0_Out-591591800, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-591591800} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:29:53,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1584274535 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1584274535 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1584274535| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1584274535| ~y$w_buff0_used~0_In1584274535)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1584274535, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1584274535} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1584274535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1584274535, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1584274535} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:29:53,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-246560226 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out-246560226| |P1Thread1of1ForFork1_#t~ite21_Out-246560226|) (= |P1Thread1of1ForFork1_#t~ite20_Out-246560226| ~y$w_buff0_used~0_In-246560226) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-246560226 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-246560226 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-246560226 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In-246560226 256) 0) .cse0))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-246560226| ~y$w_buff0_used~0_In-246560226) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-246560226| |P1Thread1of1ForFork1_#t~ite20_Out-246560226|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-246560226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-246560226, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-246560226|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-246560226, ~weak$$choice2~0=~weak$$choice2~0_In-246560226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-246560226} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-246560226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-246560226, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-246560226|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-246560226, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-246560226|, ~weak$$choice2~0=~weak$$choice2~0_In-246560226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-246560226} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:29:53,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In279135723 256))) (.cse6 (= (mod ~y$r_buff0_thd2~0_In279135723 256) 0)) (.cse4 (= 0 (mod ~y$w_buff1_used~0_In279135723 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In279135723 256) 0)) (.cse1 (= 0 (mod ~weak$$choice2~0_In279135723 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out279135723| |P1Thread1of1ForFork1_#t~ite23_Out279135723|))) (or (let ((.cse3 (not .cse6))) (and (not .cse0) .cse1 (or (not .cse2) .cse3) (= |P1Thread1of1ForFork1_#t~ite23_Out279135723| |P1Thread1of1ForFork1_#t~ite22_Out279135723|) (or (not .cse4) .cse3) .cse5 (= 0 |P1Thread1of1ForFork1_#t~ite22_Out279135723|))) (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_In279135723| |P1Thread1of1ForFork1_#t~ite23_Out279135723|) (not .cse1) (= ~y$w_buff1_used~0_In279135723 |P1Thread1of1ForFork1_#t~ite24_Out279135723|)) (and (or (and .cse2 .cse6) (and .cse6 .cse4) .cse0) .cse1 .cse5 (= ~y$w_buff1_used~0_In279135723 |P1Thread1of1ForFork1_#t~ite23_Out279135723|))) (= |P1Thread1of1ForFork1_#t~ite22_In279135723| |P1Thread1of1ForFork1_#t~ite22_Out279135723|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In279135723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In279135723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In279135723, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In279135723|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In279135723|, ~weak$$choice2~0=~weak$$choice2~0_In279135723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In279135723} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In279135723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In279135723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In279135723, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out279135723|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out279135723|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out279135723|, ~weak$$choice2~0=~weak$$choice2~0_In279135723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In279135723} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 17:29:53,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-1474750583 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1474750583 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-1474750583 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1474750583 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1474750583| ~y$w_buff1_used~0_In-1474750583)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1474750583| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1474750583, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1474750583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1474750583, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1474750583} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1474750583|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1474750583, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1474750583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1474750583, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1474750583} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:29:53,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1780925474 256))) (.cse0 (= ~y$r_buff0_thd1~0_Out1780925474 ~y$r_buff0_thd1~0_In1780925474)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1780925474 256)))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd1~0_Out1780925474 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1780925474, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1780925474} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1780925474, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1780925474|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1780925474} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:29:53,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In560521727 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In560521727 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In560521727 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In560521727 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In560521727 |P0Thread1of1ForFork0_#t~ite8_Out560521727|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out560521727|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In560521727, ~y$w_buff0_used~0=~y$w_buff0_used~0_In560521727, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In560521727, ~y$w_buff1_used~0=~y$w_buff1_used~0_In560521727} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In560521727, ~y$w_buff0_used~0=~y$w_buff0_used~0_In560521727, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out560521727|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In560521727, ~y$w_buff1_used~0=~y$w_buff1_used~0_In560521727} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:29:53,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:29:53,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In245608501 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In245608501| |P1Thread1of1ForFork1_#t~ite29_Out245608501|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out245608501| ~y$r_buff1_thd2~0_In245608501)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out245608501| |P1Thread1of1ForFork1_#t~ite29_Out245608501|) (= ~y$r_buff1_thd2~0_In245608501 |P1Thread1of1ForFork1_#t~ite29_Out245608501|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In245608501 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In245608501 256))) (and (= 0 (mod ~y$w_buff1_used~0_In245608501 256)) .cse1) (= (mod ~y$w_buff0_used~0_In245608501 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In245608501, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In245608501|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In245608501, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In245608501, ~weak$$choice2~0=~weak$$choice2~0_In245608501, ~y$w_buff1_used~0=~y$w_buff1_used~0_In245608501} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In245608501, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out245608501|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out245608501|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In245608501, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In245608501, ~weak$$choice2~0=~weak$$choice2~0_In245608501, ~y$w_buff1_used~0=~y$w_buff1_used~0_In245608501} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:29:53,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:29:53,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1302527314 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1302527314 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-1302527314 |P1Thread1of1ForFork1_#t~ite32_Out-1302527314|)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1302527314| ~y$w_buff1~0_In-1302527314) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1302527314, ~y$w_buff1~0=~y$w_buff1~0_In-1302527314, ~y~0=~y~0_In-1302527314, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1302527314} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1302527314, ~y$w_buff1~0=~y$w_buff1~0_In-1302527314, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1302527314|, ~y~0=~y~0_In-1302527314, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1302527314} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:29:53,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:29:53,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In285971206 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In285971206 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out285971206| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out285971206| ~y$w_buff0_used~0_In285971206)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In285971206, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In285971206} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In285971206, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In285971206, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out285971206|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:29:53,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2054143663 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2054143663 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-2054143663 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-2054143663 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-2054143663|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-2054143663 |P1Thread1of1ForFork1_#t~ite35_Out-2054143663|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2054143663, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2054143663, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2054143663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2054143663} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2054143663, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2054143663, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2054143663, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2054143663|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2054143663} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:29:53,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1274640066 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1274640066 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1274640066| ~y$r_buff0_thd2~0_In-1274640066)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1274640066|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1274640066, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1274640066} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1274640066, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1274640066, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1274640066|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:29:53,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In2021662855 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In2021662855 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In2021662855 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2021662855 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out2021662855|)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out2021662855| ~y$r_buff1_thd2~0_In2021662855) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2021662855, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2021662855, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2021662855, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2021662855} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2021662855, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2021662855, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2021662855, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out2021662855|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2021662855} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:29:53,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:29:53,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:29:53,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:29:53,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1398493337 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1398493337 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1398493337| ~y$w_buff1~0_In1398493337)) (and (= |ULTIMATE.start_main_#t~ite40_Out1398493337| ~y~0_In1398493337) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1398493337, ~y~0=~y~0_In1398493337, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1398493337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1398493337} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1398493337|, ~y$w_buff1~0=~y$w_buff1~0_In1398493337, ~y~0=~y~0_In1398493337, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1398493337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1398493337} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:29:53,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:29:53,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-350154972 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-350154972 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-350154972|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-350154972 |ULTIMATE.start_main_#t~ite42_Out-350154972|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-350154972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-350154972} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-350154972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-350154972, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-350154972|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:29:53,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-265356844 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-265356844 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-265356844 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-265356844 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-265356844| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-265356844| ~y$w_buff1_used~0_In-265356844) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-265356844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-265356844, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-265356844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-265356844} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-265356844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-265356844, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-265356844|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-265356844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-265356844} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:29:53,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2019057523 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2019057523 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out2019057523|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In2019057523 |ULTIMATE.start_main_#t~ite44_Out2019057523|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2019057523, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2019057523} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2019057523, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2019057523, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2019057523|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:29:53,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-1375450166 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1375450166 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1375450166 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1375450166 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1375450166| ~y$r_buff1_thd0~0_In-1375450166) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out-1375450166| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1375450166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1375450166, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1375450166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1375450166} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1375450166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1375450166, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1375450166, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1375450166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1375450166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:29:53,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:29:53,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:29:53 BasicIcfg [2019-12-07 17:29:53,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:29:53,249 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:29:53,249 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:29:53,249 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:29:53,249 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:29:40" (3/4) ... [2019-12-07 17:29:53,251 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:29:53,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= v_~y$r_buff1_thd0~0_129 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2307~0.base_48|) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48|) |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48| 1) |v_#valid_73|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48|)) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_49|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ULTIMATE.start_main_~#t2307~0.offset=|v_ULTIMATE.start_main_~#t2307~0.offset_31|, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2307~0.base=|v_ULTIMATE.start_main_~#t2307~0.base_48|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_31|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2308~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2307~0.offset, ~y$mem_tmp~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, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2307~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~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, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2308~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:29:53,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2308~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2308~0.base_13|)) (= |v_ULTIMATE.start_main_~#t2308~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13|) |v_ULTIMATE.start_main_~#t2308~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2308~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2308~0.offset] because there is no mapped edge [2019-12-07 17:29:53,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= 1 ~y$r_buff0_thd1~0_Out-591591800) (= ~y$r_buff1_thd2~0_Out-591591800 ~y$r_buff0_thd2~0_In-591591800) (= ~y$r_buff1_thd1~0_Out-591591800 ~y$r_buff0_thd1~0_In-591591800) (= 1 ~x~0_Out-591591800) (= ~y$r_buff0_thd0~0_In-591591800 ~y$r_buff1_thd0~0_Out-591591800) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-591591800))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-591591800, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-591591800, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-591591800, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-591591800} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-591591800, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-591591800, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-591591800, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-591591800, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-591591800, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-591591800, ~x~0=~x~0_Out-591591800, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-591591800} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:29:53,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1584274535 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1584274535 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1584274535| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1584274535| ~y$w_buff0_used~0_In1584274535)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1584274535, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1584274535} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1584274535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1584274535, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1584274535} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:29:53,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-246560226 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out-246560226| |P1Thread1of1ForFork1_#t~ite21_Out-246560226|) (= |P1Thread1of1ForFork1_#t~ite20_Out-246560226| ~y$w_buff0_used~0_In-246560226) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-246560226 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-246560226 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-246560226 256)) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In-246560226 256) 0) .cse0))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-246560226| ~y$w_buff0_used~0_In-246560226) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In-246560226| |P1Thread1of1ForFork1_#t~ite20_Out-246560226|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-246560226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-246560226, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-246560226|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-246560226, ~weak$$choice2~0=~weak$$choice2~0_In-246560226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-246560226} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-246560226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-246560226, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-246560226|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-246560226, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-246560226|, ~weak$$choice2~0=~weak$$choice2~0_In-246560226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-246560226} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:29:53,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In279135723 256))) (.cse6 (= (mod ~y$r_buff0_thd2~0_In279135723 256) 0)) (.cse4 (= 0 (mod ~y$w_buff1_used~0_In279135723 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In279135723 256) 0)) (.cse1 (= 0 (mod ~weak$$choice2~0_In279135723 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out279135723| |P1Thread1of1ForFork1_#t~ite23_Out279135723|))) (or (let ((.cse3 (not .cse6))) (and (not .cse0) .cse1 (or (not .cse2) .cse3) (= |P1Thread1of1ForFork1_#t~ite23_Out279135723| |P1Thread1of1ForFork1_#t~ite22_Out279135723|) (or (not .cse4) .cse3) .cse5 (= 0 |P1Thread1of1ForFork1_#t~ite22_Out279135723|))) (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_In279135723| |P1Thread1of1ForFork1_#t~ite23_Out279135723|) (not .cse1) (= ~y$w_buff1_used~0_In279135723 |P1Thread1of1ForFork1_#t~ite24_Out279135723|)) (and (or (and .cse2 .cse6) (and .cse6 .cse4) .cse0) .cse1 .cse5 (= ~y$w_buff1_used~0_In279135723 |P1Thread1of1ForFork1_#t~ite23_Out279135723|))) (= |P1Thread1of1ForFork1_#t~ite22_In279135723| |P1Thread1of1ForFork1_#t~ite22_Out279135723|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In279135723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In279135723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In279135723, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In279135723|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In279135723|, ~weak$$choice2~0=~weak$$choice2~0_In279135723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In279135723} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In279135723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In279135723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In279135723, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out279135723|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out279135723|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out279135723|, ~weak$$choice2~0=~weak$$choice2~0_In279135723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In279135723} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 17:29:53,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-1474750583 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1474750583 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-1474750583 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1474750583 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1474750583| ~y$w_buff1_used~0_In-1474750583)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1474750583| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1474750583, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1474750583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1474750583, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1474750583} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1474750583|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1474750583, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1474750583, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1474750583, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1474750583} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:29:53,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1780925474 256))) (.cse0 (= ~y$r_buff0_thd1~0_Out1780925474 ~y$r_buff0_thd1~0_In1780925474)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1780925474 256)))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd1~0_Out1780925474 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1780925474, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1780925474} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1780925474, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1780925474|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1780925474} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:29:53,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In560521727 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In560521727 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In560521727 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In560521727 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In560521727 |P0Thread1of1ForFork0_#t~ite8_Out560521727|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out560521727|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In560521727, ~y$w_buff0_used~0=~y$w_buff0_used~0_In560521727, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In560521727, ~y$w_buff1_used~0=~y$w_buff1_used~0_In560521727} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In560521727, ~y$w_buff0_used~0=~y$w_buff0_used~0_In560521727, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out560521727|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In560521727, ~y$w_buff1_used~0=~y$w_buff1_used~0_In560521727} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:29:53,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:29:53,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In245608501 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In245608501| |P1Thread1of1ForFork1_#t~ite29_Out245608501|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out245608501| ~y$r_buff1_thd2~0_In245608501)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out245608501| |P1Thread1of1ForFork1_#t~ite29_Out245608501|) (= ~y$r_buff1_thd2~0_In245608501 |P1Thread1of1ForFork1_#t~ite29_Out245608501|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In245608501 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In245608501 256))) (and (= 0 (mod ~y$w_buff1_used~0_In245608501 256)) .cse1) (= (mod ~y$w_buff0_used~0_In245608501 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In245608501, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In245608501|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In245608501, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In245608501, ~weak$$choice2~0=~weak$$choice2~0_In245608501, ~y$w_buff1_used~0=~y$w_buff1_used~0_In245608501} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In245608501, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out245608501|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out245608501|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In245608501, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In245608501, ~weak$$choice2~0=~weak$$choice2~0_In245608501, ~y$w_buff1_used~0=~y$w_buff1_used~0_In245608501} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:29:53,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:29:53,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1302527314 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1302527314 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-1302527314 |P1Thread1of1ForFork1_#t~ite32_Out-1302527314|)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1302527314| ~y$w_buff1~0_In-1302527314) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1302527314, ~y$w_buff1~0=~y$w_buff1~0_In-1302527314, ~y~0=~y~0_In-1302527314, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1302527314} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1302527314, ~y$w_buff1~0=~y$w_buff1~0_In-1302527314, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1302527314|, ~y~0=~y~0_In-1302527314, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1302527314} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:29:53,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:29:53,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In285971206 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In285971206 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out285971206| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out285971206| ~y$w_buff0_used~0_In285971206)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In285971206, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In285971206} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In285971206, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In285971206, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out285971206|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:29:53,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2054143663 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2054143663 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-2054143663 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-2054143663 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-2054143663|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-2054143663 |P1Thread1of1ForFork1_#t~ite35_Out-2054143663|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2054143663, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2054143663, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2054143663, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2054143663} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2054143663, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2054143663, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2054143663, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2054143663|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2054143663} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:29:53,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1274640066 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1274640066 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1274640066| ~y$r_buff0_thd2~0_In-1274640066)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1274640066|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1274640066, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1274640066} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1274640066, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1274640066, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1274640066|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:29:53,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In2021662855 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In2021662855 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In2021662855 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2021662855 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out2021662855|)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out2021662855| ~y$r_buff1_thd2~0_In2021662855) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2021662855, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2021662855, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2021662855, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2021662855} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2021662855, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2021662855, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2021662855, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out2021662855|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2021662855} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:29:53,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:29:53,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:29:53,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:29:53,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1398493337 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1398493337 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1398493337| ~y$w_buff1~0_In1398493337)) (and (= |ULTIMATE.start_main_#t~ite40_Out1398493337| ~y~0_In1398493337) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1398493337, ~y~0=~y~0_In1398493337, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1398493337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1398493337} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1398493337|, ~y$w_buff1~0=~y$w_buff1~0_In1398493337, ~y~0=~y~0_In1398493337, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1398493337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1398493337} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:29:53,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:29:53,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-350154972 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-350154972 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-350154972|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-350154972 |ULTIMATE.start_main_#t~ite42_Out-350154972|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-350154972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-350154972} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-350154972, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-350154972, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-350154972|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:29:53,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-265356844 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-265356844 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-265356844 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-265356844 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-265356844| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-265356844| ~y$w_buff1_used~0_In-265356844) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-265356844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-265356844, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-265356844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-265356844} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-265356844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-265356844, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-265356844|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-265356844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-265356844} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:29:53,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2019057523 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2019057523 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out2019057523|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In2019057523 |ULTIMATE.start_main_#t~ite44_Out2019057523|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2019057523, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2019057523} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2019057523, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2019057523, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2019057523|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:29:53,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-1375450166 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1375450166 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1375450166 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1375450166 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1375450166| ~y$r_buff1_thd0~0_In-1375450166) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out-1375450166| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1375450166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1375450166, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1375450166, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1375450166} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1375450166, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1375450166, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1375450166, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1375450166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1375450166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:29:53,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:29:53,308 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b80ad577-af60-45a7-b2ef-887c323ce31c/bin/uautomizer/witness.graphml [2019-12-07 17:29:53,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:29:53,310 INFO L168 Benchmark]: Toolchain (without parser) took 13962.06 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 628.1 MB). Free memory was 939.3 MB in the beginning and 903.4 MB in the end (delta: 35.9 MB). Peak memory consumption was 664.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:53,310 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:29:53,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -122.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:53,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:53,311 INFO L168 Benchmark]: Boogie Preprocessor took 26.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:53,311 INFO L168 Benchmark]: RCFGBuilder took 389.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:53,311 INFO L168 Benchmark]: TraceAbstraction took 13045.58 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 528.5 MB). Free memory was 1.0 GB in the beginning and 922.9 MB in the end (delta: 85.5 MB). Peak memory consumption was 614.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:53,312 INFO L168 Benchmark]: Witness Printer took 59.83 ms. Allocated memory is still 1.7 GB. Free memory was 922.9 MB in the beginning and 903.4 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:53,313 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 394.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -122.5 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 389.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.4 MB). Peak memory consumption was 49.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13045.58 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 528.5 MB). Free memory was 1.0 GB in the beginning and 922.9 MB in the end (delta: 85.5 MB). Peak memory consumption was 614.0 MB. Max. memory is 11.5 GB. * Witness Printer took 59.83 ms. Allocated memory is still 1.7 GB. Free memory was 922.9 MB in the beginning and 903.4 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.8s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2307, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2308, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 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_p1_EAX=1, __unbuffered_p1_EBX=0, 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=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2262 SDtfs, 3175 SDslu, 6943 SDs, 0 SdLazy, 6276 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 32 SyntacticMatches, 18 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15237occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 6548 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 698 ConstructedInterpolants, 0 QuantifiedInterpolants, 220419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...