./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_pso.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_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/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 418f4782c954c26d964ce4bcc15550f6c0c853e5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:07:59,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:07:59,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:07:59,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:07:59,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:07:59,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:07:59,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:07:59,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:07:59,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:07:59,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:07:59,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:07:59,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:07:59,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:07:59,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:07:59,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:07:59,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:07:59,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:07:59,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:07:59,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:07:59,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:07:59,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:07:59,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:07:59,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:07:59,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:07:59,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:07:59,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:07:59,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:07:59,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:07:59,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:07:59,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:07:59,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:07:59,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:07:59,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:07:59,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:07:59,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:07:59,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:07:59,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:07:59,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:07:59,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:07:59,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:07:59,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:07:59,324 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:07:59,337 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:07:59,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:07:59,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:07:59,338 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:07:59,338 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:07:59,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:07:59,339 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:07:59,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:07:59,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:07:59,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:07:59,339 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:07:59,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:07:59,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:07:59,340 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:07:59,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:07:59,340 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:07:59,340 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:07:59,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:07:59,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:07:59,341 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:07:59,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:07:59,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:07:59,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:07:59,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:07:59,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:07:59,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:07:59,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:07:59,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:07:59,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:07:59,343 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_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/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 -> 418f4782c954c26d964ce4bcc15550f6c0c853e5 [2019-12-07 17:07:59,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:07:59,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:07:59,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:07:59,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:07:59,464 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:07:59,465 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_pso.opt.i [2019-12-07 17:07:59,511 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/bin/uautomizer/data/1f2d61243/f646d896707e470ab41d7f3f46ca02e2/FLAG98918e042 [2019-12-07 17:07:59,924 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:07:59,924 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/sv-benchmarks/c/pthread-wmm/mix022_pso.opt.i [2019-12-07 17:07:59,936 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/bin/uautomizer/data/1f2d61243/f646d896707e470ab41d7f3f46ca02e2/FLAG98918e042 [2019-12-07 17:08:00,294 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/bin/uautomizer/data/1f2d61243/f646d896707e470ab41d7f3f46ca02e2 [2019-12-07 17:08:00,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:08:00,303 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:08:00,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:08:00,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:08:00,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:08:00,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:08:00" (1/1) ... [2019-12-07 17:08:00,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cadf484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:08:00, skipping insertion in model container [2019-12-07 17:08:00,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:08:00" (1/1) ... [2019-12-07 17:08:00,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:08:00,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:08:00,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:08:00,585 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:08:00,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:08:00,683 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:08:00,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:08:00 WrapperNode [2019-12-07 17:08:00,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:08:00,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:08:00,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:08:00,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:08:00,690 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:08:00" (1/1) ... [2019-12-07 17:08:00,702 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:08:00" (1/1) ... [2019-12-07 17:08:00,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:08:00,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:08:00,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:08:00,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:08:00,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:08:00" (1/1) ... [2019-12-07 17:08:00,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:08:00" (1/1) ... [2019-12-07 17:08:00,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:08:00" (1/1) ... [2019-12-07 17:08:00,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:08:00" (1/1) ... [2019-12-07 17:08:00,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:08:00" (1/1) ... [2019-12-07 17:08:00,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:08:00" (1/1) ... [2019-12-07 17:08:00,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:08:00" (1/1) ... [2019-12-07 17:08:00,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:08:00,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:08:00,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:08:00,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:08:00,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:08:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/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:08:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:08:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:08:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:08:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:08:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:08:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:08:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:08:00,787 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:08:00,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:08:00,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:08:00,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:08:00,789 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:08:01,133 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:08:01,133 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:08:01,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:08:01 BoogieIcfgContainer [2019-12-07 17:08:01,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:08:01,135 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:08:01,135 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:08:01,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:08:01,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:08:00" (1/3) ... [2019-12-07 17:08:01,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ceb3200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:08:01, skipping insertion in model container [2019-12-07 17:08:01,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:08:00" (2/3) ... [2019-12-07 17:08:01,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ceb3200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:08:01, skipping insertion in model container [2019-12-07 17:08:01,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:08:01" (3/3) ... [2019-12-07 17:08:01,138 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_pso.opt.i [2019-12-07 17:08:01,145 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:08:01,145 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:08:01,149 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:08:01,150 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:08:01,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,177 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:08:01,199 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:08:01,211 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:08:01,211 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:08:01,211 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:08:01,211 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:08:01,211 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:08:01,211 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:08:01,212 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:08:01,212 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:08:01,222 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 17:08:01,223 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:08:01,269 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:08:01,269 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:08:01,277 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 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:08:01,288 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:08:01,313 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:08:01,314 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:08:01,317 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 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:08:01,327 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:08:01,328 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:08:04,186 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 17:08:04,279 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-07 17:08:04,279 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-07 17:08:04,281 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-07 17:08:04,609 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 17:08:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 17:08:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:08:04,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:04,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:08:04,615 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:08:04,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:04,619 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-07 17:08:04,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:04,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147300949] [2019-12-07 17:08:04,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:04,754 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:08:04,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147300949] [2019-12-07 17:08:04,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:04,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:08:04,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98364844] [2019-12-07 17:08:04,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:08:04,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:04,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:08:04,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:08:04,775 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 17:08:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:04,967 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-07 17:08:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:08:04,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:08:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:05,028 INFO L225 Difference]: With dead ends: 8468 [2019-12-07 17:08:05,029 INFO L226 Difference]: Without dead ends: 7976 [2019-12-07 17:08:05,029 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:08:05,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-07 17:08:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-07 17:08:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-07 17:08:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-07 17:08:05,293 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-07 17:08:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:05,294 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-07 17:08:05,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:08:05,294 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-07 17:08:05,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:08:05,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:05,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:05,296 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:08:05,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:05,297 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-07 17:08:05,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:05,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103512230] [2019-12-07 17:08:05,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:05,364 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:08:05,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103512230] [2019-12-07 17:08:05,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:05,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:08:05,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505758560] [2019-12-07 17:08:05,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:05,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:05,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:05,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:05,366 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-07 17:08:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:05,411 INFO L93 Difference]: Finished difference Result 1834 states and 4623 transitions. [2019-12-07 17:08:05,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:05,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:08:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:05,417 INFO L225 Difference]: With dead ends: 1834 [2019-12-07 17:08:05,417 INFO L226 Difference]: Without dead ends: 1342 [2019-12-07 17:08:05,418 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:08:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-12-07 17:08:05,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2019-12-07 17:08:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-12-07 17:08:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3045 transitions. [2019-12-07 17:08:05,441 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3045 transitions. Word has length 11 [2019-12-07 17:08:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:05,441 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 3045 transitions. [2019-12-07 17:08:05,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3045 transitions. [2019-12-07 17:08:05,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:08:05,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:05,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:05,442 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:08:05,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:05,443 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-07 17:08:05,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:05,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085631515] [2019-12-07 17:08:05,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:05,496 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:08:05,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085631515] [2019-12-07 17:08:05,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:05,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:08:05,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589052523] [2019-12-07 17:08:05,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:05,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:05,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:05,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:05,497 INFO L87 Difference]: Start difference. First operand 1342 states and 3045 transitions. Second operand 4 states. [2019-12-07 17:08:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:05,619 INFO L93 Difference]: Finished difference Result 1673 states and 3729 transitions. [2019-12-07 17:08:05,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:08:05,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 17:08:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:05,627 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 17:08:05,627 INFO L226 Difference]: Without dead ends: 1673 [2019-12-07 17:08:05,627 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:08:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-07 17:08:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1609. [2019-12-07 17:08:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-12-07 17:08:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3605 transitions. [2019-12-07 17:08:05,654 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3605 transitions. Word has length 14 [2019-12-07 17:08:05,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:05,655 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3605 transitions. [2019-12-07 17:08:05,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3605 transitions. [2019-12-07 17:08:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:08:05,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:05,659 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:05,659 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:08:05,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:05,659 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-07 17:08:05,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:05,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748966967] [2019-12-07 17:08:05,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:05,752 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:08:05,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748966967] [2019-12-07 17:08:05,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:05,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:05,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598199057] [2019-12-07 17:08:05,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:08:05,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:05,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:08:05,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:08:05,754 INFO L87 Difference]: Start difference. First operand 1609 states and 3605 transitions. Second operand 6 states. [2019-12-07 17:08:06,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:06,290 INFO L93 Difference]: Finished difference Result 4481 states and 9905 transitions. [2019-12-07 17:08:06,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:08:06,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 17:08:06,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:06,309 INFO L225 Difference]: With dead ends: 4481 [2019-12-07 17:08:06,309 INFO L226 Difference]: Without dead ends: 4446 [2019-12-07 17:08:06,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:08:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-12-07 17:08:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2169. [2019-12-07 17:08:06,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-12-07 17:08:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 4909 transitions. [2019-12-07 17:08:06,355 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 4909 transitions. Word has length 25 [2019-12-07 17:08:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:06,355 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 4909 transitions. [2019-12-07 17:08:06,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:08:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 4909 transitions. [2019-12-07 17:08:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:08:06,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:06,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:06,357 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:08:06,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:06,357 INFO L82 PathProgramCache]: Analyzing trace with hash -662536504, now seen corresponding path program 1 times [2019-12-07 17:08:06,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:06,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563421158] [2019-12-07 17:08:06,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:06,414 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:08:06,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563421158] [2019-12-07 17:08:06,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:06,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:08:06,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082373295] [2019-12-07 17:08:06,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:08:06,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:06,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:08:06,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:08:06,415 INFO L87 Difference]: Start difference. First operand 2169 states and 4909 transitions. Second operand 5 states. [2019-12-07 17:08:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:06,701 INFO L93 Difference]: Finished difference Result 3139 states and 6955 transitions. [2019-12-07 17:08:06,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:08:06,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 17:08:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:06,716 INFO L225 Difference]: With dead ends: 3139 [2019-12-07 17:08:06,716 INFO L226 Difference]: Without dead ends: 3139 [2019-12-07 17:08:06,717 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:08:06,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-12-07 17:08:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2639. [2019-12-07 17:08:06,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-12-07 17:08:06,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 5924 transitions. [2019-12-07 17:08:06,756 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 5924 transitions. Word has length 26 [2019-12-07 17:08:06,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:06,756 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 5924 transitions. [2019-12-07 17:08:06,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:08:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 5924 transitions. [2019-12-07 17:08:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:08:06,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:06,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:06,759 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:08:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:06,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-07 17:08:06,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:06,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018463682] [2019-12-07 17:08:06,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:06,818 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:08:06,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018463682] [2019-12-07 17:08:06,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:06,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:06,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748083387] [2019-12-07 17:08:06,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:08:06,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:06,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:08:06,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:08:06,820 INFO L87 Difference]: Start difference. First operand 2639 states and 5924 transitions. Second operand 6 states. [2019-12-07 17:08:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:07,176 INFO L93 Difference]: Finished difference Result 5512 states and 12000 transitions. [2019-12-07 17:08:07,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:08:07,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 17:08:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:07,187 INFO L225 Difference]: With dead ends: 5512 [2019-12-07 17:08:07,187 INFO L226 Difference]: Without dead ends: 5483 [2019-12-07 17:08:07,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:08:07,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2019-12-07 17:08:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 2614. [2019-12-07 17:08:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2019-12-07 17:08:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 5890 transitions. [2019-12-07 17:08:07,238 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 5890 transitions. Word has length 26 [2019-12-07 17:08:07,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:07,238 INFO L462 AbstractCegarLoop]: Abstraction has 2614 states and 5890 transitions. [2019-12-07 17:08:07,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:08:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 5890 transitions. [2019-12-07 17:08:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:08:07,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:07,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:07,241 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:08:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash -312964189, now seen corresponding path program 1 times [2019-12-07 17:08:07,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:07,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348852906] [2019-12-07 17:08:07,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:07,297 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:08:07,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348852906] [2019-12-07 17:08:07,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:07,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:07,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527118447] [2019-12-07 17:08:07,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:08:07,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:07,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:08:07,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:08:07,299 INFO L87 Difference]: Start difference. First operand 2614 states and 5890 transitions. Second operand 5 states. [2019-12-07 17:08:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:07,329 INFO L93 Difference]: Finished difference Result 1600 states and 3459 transitions. [2019-12-07 17:08:07,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:08:07,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:08:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:07,332 INFO L225 Difference]: With dead ends: 1600 [2019-12-07 17:08:07,332 INFO L226 Difference]: Without dead ends: 1454 [2019-12-07 17:08:07,332 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:08:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2019-12-07 17:08:07,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1353. [2019-12-07 17:08:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2019-12-07 17:08:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2958 transitions. [2019-12-07 17:08:07,349 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2958 transitions. Word has length 27 [2019-12-07 17:08:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:07,349 INFO L462 AbstractCegarLoop]: Abstraction has 1353 states and 2958 transitions. [2019-12-07 17:08:07,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:08:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2958 transitions. [2019-12-07 17:08:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:08:07,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:07,352 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:08:07,352 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:08:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:07,353 INFO L82 PathProgramCache]: Analyzing trace with hash 62245946, now seen corresponding path program 1 times [2019-12-07 17:08:07,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:07,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550714584] [2019-12-07 17:08:07,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:07,405 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:08:07,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550714584] [2019-12-07 17:08:07,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:07,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:08:07,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206087053] [2019-12-07 17:08:07,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:08:07,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:07,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:08:07,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:08:07,407 INFO L87 Difference]: Start difference. First operand 1353 states and 2958 transitions. Second operand 3 states. [2019-12-07 17:08:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:07,444 INFO L93 Difference]: Finished difference Result 1781 states and 3848 transitions. [2019-12-07 17:08:07,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:08:07,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 17:08:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:07,447 INFO L225 Difference]: With dead ends: 1781 [2019-12-07 17:08:07,447 INFO L226 Difference]: Without dead ends: 1781 [2019-12-07 17:08:07,447 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:08:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2019-12-07 17:08:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1430. [2019-12-07 17:08:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2019-12-07 17:08:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 3145 transitions. [2019-12-07 17:08:07,468 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 3145 transitions. Word has length 51 [2019-12-07 17:08:07,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:07,468 INFO L462 AbstractCegarLoop]: Abstraction has 1430 states and 3145 transitions. [2019-12-07 17:08:07,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:08:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 3145 transitions. [2019-12-07 17:08:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:08:07,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:07,471 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:08:07,471 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:08:07,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:07,472 INFO L82 PathProgramCache]: Analyzing trace with hash -972871791, now seen corresponding path program 1 times [2019-12-07 17:08:07,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:07,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516470059] [2019-12-07 17:08:07,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:07,579 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:08:07,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516470059] [2019-12-07 17:08:07,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:07,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:08:07,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107948431] [2019-12-07 17:08:07,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:08:07,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:07,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:08:07,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:08:07,581 INFO L87 Difference]: Start difference. First operand 1430 states and 3145 transitions. Second operand 8 states. [2019-12-07 17:08:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:08,519 INFO L93 Difference]: Finished difference Result 3135 states and 6650 transitions. [2019-12-07 17:08:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 17:08:08,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-07 17:08:08,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:08,523 INFO L225 Difference]: With dead ends: 3135 [2019-12-07 17:08:08,523 INFO L226 Difference]: Without dead ends: 3135 [2019-12-07 17:08:08,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:08:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3135 states. [2019-12-07 17:08:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3135 to 1468. [2019-12-07 17:08:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2019-12-07 17:08:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 3211 transitions. [2019-12-07 17:08:08,549 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 3211 transitions. Word has length 52 [2019-12-07 17:08:08,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:08,549 INFO L462 AbstractCegarLoop]: Abstraction has 1468 states and 3211 transitions. [2019-12-07 17:08:08,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:08:08,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 3211 transitions. [2019-12-07 17:08:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:08:08,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:08,552 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:08,552 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:08:08,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:08,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1641556840, now seen corresponding path program 1 times [2019-12-07 17:08:08,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:08,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678681558] [2019-12-07 17:08:08,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:08,636 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:08:08,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678681558] [2019-12-07 17:08:08,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:08,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:08:08,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842341539] [2019-12-07 17:08:08,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:08:08,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:08,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:08:08,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:08:08,637 INFO L87 Difference]: Start difference. First operand 1468 states and 3211 transitions. Second operand 7 states. [2019-12-07 17:08:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:09,316 INFO L93 Difference]: Finished difference Result 2900 states and 6077 transitions. [2019-12-07 17:08:09,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:08:09,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 17:08:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:09,318 INFO L225 Difference]: With dead ends: 2900 [2019-12-07 17:08:09,318 INFO L226 Difference]: Without dead ends: 2900 [2019-12-07 17:08:09,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:08:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2019-12-07 17:08:09,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 1506. [2019-12-07 17:08:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2019-12-07 17:08:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 3296 transitions. [2019-12-07 17:08:09,344 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 3296 transitions. Word has length 52 [2019-12-07 17:08:09,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:09,344 INFO L462 AbstractCegarLoop]: Abstraction has 1506 states and 3296 transitions. [2019-12-07 17:08:09,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:08:09,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 3296 transitions. [2019-12-07 17:08:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:08:09,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:09,346 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:08:09,346 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:08:09,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash 843046701, now seen corresponding path program 2 times [2019-12-07 17:08:09,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:09,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544547061] [2019-12-07 17:08:09,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:09,399 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:08:09,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544547061] [2019-12-07 17:08:09,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:09,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:08:09,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622452237] [2019-12-07 17:08:09,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:08:09,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:09,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:08:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:08:09,400 INFO L87 Difference]: Start difference. First operand 1506 states and 3296 transitions. Second operand 3 states. [2019-12-07 17:08:09,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:09,410 INFO L93 Difference]: Finished difference Result 1505 states and 3294 transitions. [2019-12-07 17:08:09,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:08:09,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:08:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:09,412 INFO L225 Difference]: With dead ends: 1505 [2019-12-07 17:08:09,412 INFO L226 Difference]: Without dead ends: 1505 [2019-12-07 17:08:09,412 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:08:09,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-12-07 17:08:09,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1049. [2019-12-07 17:08:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2019-12-07 17:08:09,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 2330 transitions. [2019-12-07 17:08:09,439 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 2330 transitions. Word has length 52 [2019-12-07 17:08:09,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:09,440 INFO L462 AbstractCegarLoop]: Abstraction has 1049 states and 2330 transitions. [2019-12-07 17:08:09,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:08:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 2330 transitions. [2019-12-07 17:08:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:08:09,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:09,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:09,442 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:08:09,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:09,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1343423494, now seen corresponding path program 1 times [2019-12-07 17:08:09,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:09,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131785128] [2019-12-07 17:08:09,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:09,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:09,681 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:08:09,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131785128] [2019-12-07 17:08:09,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:09,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 17:08:09,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878530790] [2019-12-07 17:08:09,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:08:09,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:09,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:08:09,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:08:09,683 INFO L87 Difference]: Start difference. First operand 1049 states and 2330 transitions. Second operand 14 states. [2019-12-07 17:08:10,915 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2019-12-07 17:08:11,254 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2019-12-07 17:08:16,466 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-12-07 17:08:16,785 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-12-07 17:08:17,814 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-07 17:08:18,498 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-12-07 17:08:19,106 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-12-07 17:08:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:21,242 INFO L93 Difference]: Finished difference Result 9209 states and 19470 transitions. [2019-12-07 17:08:21,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-12-07 17:08:21,242 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-12-07 17:08:21,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:21,246 INFO L225 Difference]: With dead ends: 9209 [2019-12-07 17:08:21,246 INFO L226 Difference]: Without dead ends: 6428 [2019-12-07 17:08:21,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8154 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3139, Invalid=16043, Unknown=0, NotChecked=0, Total=19182 [2019-12-07 17:08:21,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6428 states. [2019-12-07 17:08:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6428 to 1338. [2019-12-07 17:08:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2019-12-07 17:08:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 2972 transitions. [2019-12-07 17:08:21,281 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 2972 transitions. Word has length 53 [2019-12-07 17:08:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:21,281 INFO L462 AbstractCegarLoop]: Abstraction has 1338 states and 2972 transitions. [2019-12-07 17:08:21,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:08:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 2972 transitions. [2019-12-07 17:08:21,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:08:21,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:21,283 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:21,283 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:08:21,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:21,284 INFO L82 PathProgramCache]: Analyzing trace with hash -75320077, now seen corresponding path program 1 times [2019-12-07 17:08:21,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:21,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708899268] [2019-12-07 17:08:21,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:21,324 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:08:21,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708899268] [2019-12-07 17:08:21,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:21,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:08:21,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551053193] [2019-12-07 17:08:21,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:21,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:21,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:21,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:21,326 INFO L87 Difference]: Start difference. First operand 1338 states and 2972 transitions. Second operand 4 states. [2019-12-07 17:08:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:21,366 INFO L93 Difference]: Finished difference Result 1327 states and 2936 transitions. [2019-12-07 17:08:21,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:21,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 17:08:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:21,368 INFO L225 Difference]: With dead ends: 1327 [2019-12-07 17:08:21,368 INFO L226 Difference]: Without dead ends: 1327 [2019-12-07 17:08:21,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:08:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2019-12-07 17:08:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1233. [2019-12-07 17:08:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-07 17:08:21,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2721 transitions. [2019-12-07 17:08:21,379 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2721 transitions. Word has length 53 [2019-12-07 17:08:21,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:21,379 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 2721 transitions. [2019-12-07 17:08:21,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2721 transitions. [2019-12-07 17:08:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:08:21,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:21,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:21,381 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:21,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1716506603, now seen corresponding path program 1 times [2019-12-07 17:08:21,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:21,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447849050] [2019-12-07 17:08:21,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:21,403 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:08:21,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447849050] [2019-12-07 17:08:21,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:21,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:08:21,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470702587] [2019-12-07 17:08:21,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:08:21,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:21,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:08:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:08:21,404 INFO L87 Difference]: Start difference. First operand 1233 states and 2721 transitions. Second operand 3 states. [2019-12-07 17:08:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:21,424 INFO L93 Difference]: Finished difference Result 1473 states and 3141 transitions. [2019-12-07 17:08:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:08:21,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 17:08:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:21,426 INFO L225 Difference]: With dead ends: 1473 [2019-12-07 17:08:21,426 INFO L226 Difference]: Without dead ends: 1453 [2019-12-07 17:08:21,426 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:08:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-12-07 17:08:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1156. [2019-12-07 17:08:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-12-07 17:08:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 2512 transitions. [2019-12-07 17:08:21,443 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 2512 transitions. Word has length 53 [2019-12-07 17:08:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:21,443 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 2512 transitions. [2019-12-07 17:08:21,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:08:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 2512 transitions. [2019-12-07 17:08:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:08:21,445 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:21,445 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:21,445 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:08:21,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:21,446 INFO L82 PathProgramCache]: Analyzing trace with hash 718363752, now seen corresponding path program 2 times [2019-12-07 17:08:21,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:21,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751999945] [2019-12-07 17:08:21,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:21,513 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:08:21,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751999945] [2019-12-07 17:08:21,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:21,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:08:21,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494571612] [2019-12-07 17:08:21,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:21,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:21,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:21,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:21,515 INFO L87 Difference]: Start difference. First operand 1156 states and 2512 transitions. Second operand 4 states. [2019-12-07 17:08:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:21,527 INFO L93 Difference]: Finished difference Result 2043 states and 4422 transitions. [2019-12-07 17:08:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:21,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 17:08:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:21,528 INFO L225 Difference]: With dead ends: 2043 [2019-12-07 17:08:21,528 INFO L226 Difference]: Without dead ends: 980 [2019-12-07 17:08:21,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2019-12-07 17:08:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 980. [2019-12-07 17:08:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-12-07 17:08:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2098 transitions. [2019-12-07 17:08:21,537 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2098 transitions. Word has length 53 [2019-12-07 17:08:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:21,537 INFO L462 AbstractCegarLoop]: Abstraction has 980 states and 2098 transitions. [2019-12-07 17:08:21,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2098 transitions. [2019-12-07 17:08:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:08:21,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:21,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:21,539 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:08:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:21,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1803579188, now seen corresponding path program 3 times [2019-12-07 17:08:21,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:21,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411155153] [2019-12-07 17:08:21,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:21,731 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:08:21,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411155153] [2019-12-07 17:08:21,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:21,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:08:21,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284315347] [2019-12-07 17:08:21,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:08:21,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:21,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:08:21,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:08:21,732 INFO L87 Difference]: Start difference. First operand 980 states and 2098 transitions. Second operand 12 states. [2019-12-07 17:08:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:22,417 INFO L93 Difference]: Finished difference Result 1539 states and 3217 transitions. [2019-12-07 17:08:22,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 17:08:22,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-07 17:08:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:22,418 INFO L225 Difference]: With dead ends: 1539 [2019-12-07 17:08:22,418 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 17:08:22,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:08:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 17:08:22,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 981. [2019-12-07 17:08:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-12-07 17:08:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 2087 transitions. [2019-12-07 17:08:22,426 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 2087 transitions. Word has length 53 [2019-12-07 17:08:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:22,427 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 2087 transitions. [2019-12-07 17:08:22,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:08:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 2087 transitions. [2019-12-07 17:08:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:08:22,428 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:22,428 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:22,428 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:08:22,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:22,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1101315546, now seen corresponding path program 4 times [2019-12-07 17:08:22,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:22,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515905264] [2019-12-07 17:08:22,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:22,489 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:08:22,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515905264] [2019-12-07 17:08:22,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:22,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:08:22,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169661179] [2019-12-07 17:08:22,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:08:22,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:22,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:08:22,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:08:22,491 INFO L87 Difference]: Start difference. First operand 981 states and 2087 transitions. Second operand 7 states. [2019-12-07 17:08:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:22,624 INFO L93 Difference]: Finished difference Result 1576 states and 3277 transitions. [2019-12-07 17:08:22,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:08:22,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 17:08:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:22,625 INFO L225 Difference]: With dead ends: 1576 [2019-12-07 17:08:22,625 INFO L226 Difference]: Without dead ends: 1098 [2019-12-07 17:08:22,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:08:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-12-07 17:08:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 969. [2019-12-07 17:08:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-12-07 17:08:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2054 transitions. [2019-12-07 17:08:22,634 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 2054 transitions. Word has length 53 [2019-12-07 17:08:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:22,634 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 2054 transitions. [2019-12-07 17:08:22,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:08:22,634 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2054 transitions. [2019-12-07 17:08:22,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:08:22,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:22,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:22,636 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:08:22,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:22,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 5 times [2019-12-07 17:08:22,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:22,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67462618] [2019-12-07 17:08:22,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:08:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:08:22,706 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:08:22,706 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:08:22,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= (select .cse0 |v_ULTIMATE.start_main_~#t591~0.base_29|) 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t591~0.base_29|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 |v_ULTIMATE.start_main_~#t591~0.offset_20|) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t591~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t591~0.base_29|) |v_ULTIMATE.start_main_~#t591~0.offset_20| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t591~0.base_29| 4)) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t591~0.base_29| 1)) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, ULTIMATE.start_main_~#t591~0.offset=|v_ULTIMATE.start_main_~#t591~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ULTIMATE.start_main_~#t591~0.base=|v_ULTIMATE.start_main_~#t591~0.base_29|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_17|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t591~0.offset, #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, ULTIMATE.start_main_~#t591~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~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, ULTIMATE.start_main_~#t592~0.base, ULTIMATE.start_main_~#t592~0.offset, ~main$tmp_guard0~0, #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, ~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:08:22,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t592~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12|) |v_ULTIMATE.start_main_~#t592~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t592~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t592~0.offset_10| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t592~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t592~0.offset, #length] because there is no mapped edge [2019-12-07 17:08:22,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} 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:08:22,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-742700099 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-742700099 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-742700099| ~y$w_buff0_used~0_In-742700099)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-742700099|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-742700099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-742700099} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-742700099|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-742700099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-742700099} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:08:22,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2093979512 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2093979512 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-2093979512 256)) (and (= (mod ~y$w_buff1_used~0_In-2093979512 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-2093979512 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite15_Out-2093979512| |P1Thread1of1ForFork1_#t~ite14_Out-2093979512|) (= ~y$w_buff0~0_In-2093979512 |P1Thread1of1ForFork1_#t~ite14_Out-2093979512|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-2093979512| |P1Thread1of1ForFork1_#t~ite14_Out-2093979512|) (= ~y$w_buff0~0_In-2093979512 |P1Thread1of1ForFork1_#t~ite15_Out-2093979512|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2093979512, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2093979512, ~y$w_buff0~0=~y$w_buff0~0_In-2093979512, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2093979512, ~weak$$choice2~0=~weak$$choice2~0_In-2093979512, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-2093979512|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2093979512} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2093979512, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2093979512, ~y$w_buff0~0=~y$w_buff0~0_In-2093979512, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2093979512, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-2093979512|, ~weak$$choice2~0=~weak$$choice2~0_In-2093979512, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2093979512|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2093979512} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:08:22,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In383857976 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out383857976| ~y$w_buff1~0_In383857976) (= |P1Thread1of1ForFork1_#t~ite17_In383857976| |P1Thread1of1ForFork1_#t~ite17_Out383857976|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out383857976| |P1Thread1of1ForFork1_#t~ite17_Out383857976|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In383857976 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In383857976 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In383857976 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In383857976 256) 0)))) (= ~y$w_buff1~0_In383857976 |P1Thread1of1ForFork1_#t~ite17_Out383857976|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In383857976, ~y$w_buff1~0=~y$w_buff1~0_In383857976, ~y$w_buff0_used~0=~y$w_buff0_used~0_In383857976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In383857976, ~weak$$choice2~0=~weak$$choice2~0_In383857976, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In383857976|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In383857976} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In383857976, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out383857976|, ~y$w_buff1~0=~y$w_buff1~0_In383857976, ~y$w_buff0_used~0=~y$w_buff0_used~0_In383857976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In383857976, ~weak$$choice2~0=~weak$$choice2~0_In383857976, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out383857976|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In383857976} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 17:08:22,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2069093692 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In2069093692 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In2069093692 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2069093692 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out2069093692| ~y$w_buff1_used~0_In2069093692) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out2069093692| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2069093692, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2069093692, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2069093692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2069093692} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2069093692|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2069093692, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2069093692, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2069093692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2069093692} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:08:22,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-628893216 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-628893216 256))) (.cse2 (= ~y$r_buff0_thd1~0_In-628893216 ~y$r_buff0_thd1~0_Out-628893216))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-628893216)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-628893216, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-628893216} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-628893216, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-628893216|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-628893216} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:08:22,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1140405164 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1140405164 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1140405164 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1140405164 256)))) (or (and (= ~y$r_buff1_thd1~0_In1140405164 |P0Thread1of1ForFork0_#t~ite8_Out1140405164|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1140405164|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1140405164, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1140405164, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1140405164, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1140405164} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1140405164, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1140405164, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1140405164|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1140405164, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1140405164} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:08:22,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1285971062 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1285971062 |P1Thread1of1ForFork1_#t~ite20_Out-1285971062|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1285971062| |P1Thread1of1ForFork1_#t~ite20_Out-1285971062|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1285971062 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1285971062 256))) (= 0 (mod ~y$w_buff0_used~0_In-1285971062 256)) (and (= (mod ~y$w_buff1_used~0_In-1285971062 256) 0) .cse1)))) (and (= ~y$w_buff0_used~0_In-1285971062 |P1Thread1of1ForFork1_#t~ite21_Out-1285971062|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1285971062| |P1Thread1of1ForFork1_#t~ite20_Out-1285971062|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285971062, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285971062, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1285971062|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1285971062, ~weak$$choice2~0=~weak$$choice2~0_In-1285971062, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285971062} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285971062, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285971062, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1285971062|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1285971062, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1285971062|, ~weak$$choice2~0=~weak$$choice2~0_In-1285971062, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285971062} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:08:22,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:08:22,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-901591436 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-901591436 |P1Thread1of1ForFork1_#t~ite30_Out-901591436|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-901591436| |P1Thread1of1ForFork1_#t~ite29_Out-901591436|)) (and (= ~y$r_buff1_thd2~0_In-901591436 |P1Thread1of1ForFork1_#t~ite29_Out-901591436|) (= |P1Thread1of1ForFork1_#t~ite30_Out-901591436| |P1Thread1of1ForFork1_#t~ite29_Out-901591436|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-901591436 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-901591436 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-901591436 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-901591436 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-901591436, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-901591436|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-901591436, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-901591436, ~weak$$choice2~0=~weak$$choice2~0_In-901591436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-901591436} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-901591436, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-901591436|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-901591436|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-901591436, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-901591436, ~weak$$choice2~0=~weak$$choice2~0_In-901591436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-901591436} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:08:22,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} 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:08:22,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} 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_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:08:22,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-662131236 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-662131236 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-662131236| ~y~0_In-662131236) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-662131236| ~y$w_buff1~0_In-662131236) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-662131236, ~y$w_buff1~0=~y$w_buff1~0_In-662131236, ~y~0=~y~0_In-662131236, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-662131236} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-662131236, ~y$w_buff1~0=~y$w_buff1~0_In-662131236, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-662131236|, ~y~0=~y~0_In-662131236, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-662131236} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:08:22,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:08:22,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1441091693 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1441091693 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1441091693| ~y$w_buff0_used~0_In1441091693)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1441091693|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1441091693, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1441091693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1441091693, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1441091693, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1441091693|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:08:22,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-738603323 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-738603323 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-738603323 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-738603323 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-738603323 |P1Thread1of1ForFork1_#t~ite35_Out-738603323|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-738603323|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-738603323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-738603323, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-738603323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-738603323} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-738603323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-738603323, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-738603323, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-738603323|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-738603323} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:08:22,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1667404761 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1667404761 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1667404761|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1667404761 |P1Thread1of1ForFork1_#t~ite36_Out1667404761|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1667404761, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1667404761} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1667404761, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1667404761, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1667404761|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:08:22,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In295699951 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In295699951 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In295699951 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In295699951 256)))) (or (and (= ~y$r_buff1_thd2~0_In295699951 |P1Thread1of1ForFork1_#t~ite37_Out295699951|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out295699951| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In295699951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In295699951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In295699951, ~y$w_buff1_used~0=~y$w_buff1_used~0_In295699951} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In295699951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In295699951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In295699951, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out295699951|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In295699951} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:08:22,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} 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:08:22,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:08:22,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-433678553 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-433678553 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-433678553| ~y$w_buff1~0_In-433678553) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-433678553| ~y~0_In-433678553) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-433678553, ~y~0=~y~0_In-433678553, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-433678553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-433678553} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-433678553|, ~y$w_buff1~0=~y$w_buff1~0_In-433678553, ~y~0=~y~0_In-433678553, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-433678553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-433678553} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:08:22,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:08:22,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1001425197 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1001425197 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1001425197| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1001425197 |ULTIMATE.start_main_#t~ite42_Out-1001425197|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1001425197, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1001425197} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1001425197, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1001425197, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1001425197|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:08:22,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1139390717 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1139390717 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1139390717 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1139390717 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1139390717|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1139390717 |ULTIMATE.start_main_#t~ite43_Out1139390717|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1139390717, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1139390717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1139390717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139390717} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1139390717, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1139390717, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1139390717|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1139390717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139390717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:08:22,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In143221292 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In143221292 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In143221292 |ULTIMATE.start_main_#t~ite44_Out143221292|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out143221292|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In143221292, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In143221292} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In143221292, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In143221292, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out143221292|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:08:22,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-705304329 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-705304329 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-705304329 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-705304329 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-705304329| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-705304329| ~y$r_buff1_thd0~0_In-705304329) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-705304329, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-705304329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-705304329, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-705304329} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-705304329, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-705304329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-705304329, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-705304329|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-705304329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:08:22,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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:08:22,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:08:22 BasicIcfg [2019-12-07 17:08:22,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:08:22,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:08:22,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:08:22,756 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:08:22,757 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:08:01" (3/4) ... [2019-12-07 17:08:22,758 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:08:22,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= (select .cse0 |v_ULTIMATE.start_main_~#t591~0.base_29|) 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t591~0.base_29|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 |v_ULTIMATE.start_main_~#t591~0.offset_20|) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t591~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t591~0.base_29|) |v_ULTIMATE.start_main_~#t591~0.offset_20| 0)) |v_#memory_int_15|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t591~0.base_29| 4)) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t591~0.base_29| 1)) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, ULTIMATE.start_main_~#t591~0.offset=|v_ULTIMATE.start_main_~#t591~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ULTIMATE.start_main_~#t591~0.base=|v_ULTIMATE.start_main_~#t591~0.base_29|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_17|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t591~0.offset, #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, ULTIMATE.start_main_~#t591~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~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, ULTIMATE.start_main_~#t592~0.base, ULTIMATE.start_main_~#t592~0.offset, ~main$tmp_guard0~0, #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, ~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:08:22,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t592~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12|) |v_ULTIMATE.start_main_~#t592~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t592~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t592~0.offset_10| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t592~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t592~0.offset, #length] because there is no mapped edge [2019-12-07 17:08:22,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} 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:08:22,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-742700099 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-742700099 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-742700099| ~y$w_buff0_used~0_In-742700099)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-742700099|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-742700099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-742700099} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-742700099|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-742700099, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-742700099} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:08:22,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2093979512 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2093979512 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-2093979512 256)) (and (= (mod ~y$w_buff1_used~0_In-2093979512 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-2093979512 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite15_Out-2093979512| |P1Thread1of1ForFork1_#t~ite14_Out-2093979512|) (= ~y$w_buff0~0_In-2093979512 |P1Thread1of1ForFork1_#t~ite14_Out-2093979512|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In-2093979512| |P1Thread1of1ForFork1_#t~ite14_Out-2093979512|) (= ~y$w_buff0~0_In-2093979512 |P1Thread1of1ForFork1_#t~ite15_Out-2093979512|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2093979512, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2093979512, ~y$w_buff0~0=~y$w_buff0~0_In-2093979512, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2093979512, ~weak$$choice2~0=~weak$$choice2~0_In-2093979512, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-2093979512|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2093979512} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2093979512, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2093979512, ~y$w_buff0~0=~y$w_buff0~0_In-2093979512, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2093979512, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-2093979512|, ~weak$$choice2~0=~weak$$choice2~0_In-2093979512, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2093979512|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2093979512} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 17:08:22,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In383857976 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out383857976| ~y$w_buff1~0_In383857976) (= |P1Thread1of1ForFork1_#t~ite17_In383857976| |P1Thread1of1ForFork1_#t~ite17_Out383857976|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite18_Out383857976| |P1Thread1of1ForFork1_#t~ite17_Out383857976|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In383857976 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In383857976 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In383857976 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In383857976 256) 0)))) (= ~y$w_buff1~0_In383857976 |P1Thread1of1ForFork1_#t~ite17_Out383857976|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In383857976, ~y$w_buff1~0=~y$w_buff1~0_In383857976, ~y$w_buff0_used~0=~y$w_buff0_used~0_In383857976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In383857976, ~weak$$choice2~0=~weak$$choice2~0_In383857976, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In383857976|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In383857976} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In383857976, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out383857976|, ~y$w_buff1~0=~y$w_buff1~0_In383857976, ~y$w_buff0_used~0=~y$w_buff0_used~0_In383857976, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In383857976, ~weak$$choice2~0=~weak$$choice2~0_In383857976, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out383857976|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In383857976} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 17:08:22,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In2069093692 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In2069093692 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In2069093692 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In2069093692 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out2069093692| ~y$w_buff1_used~0_In2069093692) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out2069093692| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2069093692, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2069093692, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2069093692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2069093692} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2069093692|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2069093692, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2069093692, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2069093692, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2069093692} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:08:22,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-628893216 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-628893216 256))) (.cse2 (= ~y$r_buff0_thd1~0_In-628893216 ~y$r_buff0_thd1~0_Out-628893216))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-628893216)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-628893216, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-628893216} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-628893216, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-628893216|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-628893216} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:08:22,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1140405164 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1140405164 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1140405164 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1140405164 256)))) (or (and (= ~y$r_buff1_thd1~0_In1140405164 |P0Thread1of1ForFork0_#t~ite8_Out1140405164|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1140405164|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1140405164, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1140405164, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1140405164, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1140405164} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1140405164, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1140405164, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1140405164|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1140405164, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1140405164} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:08:22,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1285971062 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1285971062 |P1Thread1of1ForFork1_#t~ite20_Out-1285971062|) (= |P1Thread1of1ForFork1_#t~ite21_Out-1285971062| |P1Thread1of1ForFork1_#t~ite20_Out-1285971062|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1285971062 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1285971062 256))) (= 0 (mod ~y$w_buff0_used~0_In-1285971062 256)) (and (= (mod ~y$w_buff1_used~0_In-1285971062 256) 0) .cse1)))) (and (= ~y$w_buff0_used~0_In-1285971062 |P1Thread1of1ForFork1_#t~ite21_Out-1285971062|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1285971062| |P1Thread1of1ForFork1_#t~ite20_Out-1285971062|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285971062, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285971062, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1285971062|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1285971062, ~weak$$choice2~0=~weak$$choice2~0_In-1285971062, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285971062} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285971062, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1285971062, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1285971062|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1285971062, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1285971062|, ~weak$$choice2~0=~weak$$choice2~0_In-1285971062, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285971062} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:08:22,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 17:08:22,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-901591436 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-901591436 |P1Thread1of1ForFork1_#t~ite30_Out-901591436|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-901591436| |P1Thread1of1ForFork1_#t~ite29_Out-901591436|)) (and (= ~y$r_buff1_thd2~0_In-901591436 |P1Thread1of1ForFork1_#t~ite29_Out-901591436|) (= |P1Thread1of1ForFork1_#t~ite30_Out-901591436| |P1Thread1of1ForFork1_#t~ite29_Out-901591436|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-901591436 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In-901591436 256)) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-901591436 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-901591436 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-901591436, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-901591436|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-901591436, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-901591436, ~weak$$choice2~0=~weak$$choice2~0_In-901591436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-901591436} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-901591436, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-901591436|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-901591436|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-901591436, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-901591436, ~weak$$choice2~0=~weak$$choice2~0_In-901591436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-901591436} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:08:22,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} 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:08:22,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} 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_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:08:22,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-662131236 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-662131236 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-662131236| ~y~0_In-662131236) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-662131236| ~y$w_buff1~0_In-662131236) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-662131236, ~y$w_buff1~0=~y$w_buff1~0_In-662131236, ~y~0=~y~0_In-662131236, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-662131236} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-662131236, ~y$w_buff1~0=~y$w_buff1~0_In-662131236, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-662131236|, ~y~0=~y~0_In-662131236, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-662131236} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:08:22,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:08:22,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1441091693 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1441091693 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1441091693| ~y$w_buff0_used~0_In1441091693)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1441091693|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1441091693, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1441091693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1441091693, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1441091693, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1441091693|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:08:22,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-738603323 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-738603323 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-738603323 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-738603323 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-738603323 |P1Thread1of1ForFork1_#t~ite35_Out-738603323|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-738603323|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-738603323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-738603323, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-738603323, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-738603323} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-738603323, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-738603323, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-738603323, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-738603323|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-738603323} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:08:22,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1667404761 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1667404761 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1667404761|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1667404761 |P1Thread1of1ForFork1_#t~ite36_Out1667404761|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1667404761, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1667404761} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1667404761, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1667404761, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1667404761|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:08:22,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In295699951 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In295699951 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In295699951 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In295699951 256)))) (or (and (= ~y$r_buff1_thd2~0_In295699951 |P1Thread1of1ForFork1_#t~ite37_Out295699951|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out295699951| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In295699951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In295699951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In295699951, ~y$w_buff1_used~0=~y$w_buff1_used~0_In295699951} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In295699951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In295699951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In295699951, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out295699951|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In295699951} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:08:22,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} 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:08:22,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:08:22,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-433678553 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-433678553 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-433678553| ~y$w_buff1~0_In-433678553) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-433678553| ~y~0_In-433678553) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-433678553, ~y~0=~y~0_In-433678553, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-433678553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-433678553} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-433678553|, ~y$w_buff1~0=~y$w_buff1~0_In-433678553, ~y~0=~y~0_In-433678553, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-433678553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-433678553} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:08:22,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:08:22,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1001425197 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1001425197 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1001425197| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1001425197 |ULTIMATE.start_main_#t~ite42_Out-1001425197|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1001425197, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1001425197} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1001425197, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1001425197, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1001425197|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:08:22,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In1139390717 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1139390717 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1139390717 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1139390717 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1139390717|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1139390717 |ULTIMATE.start_main_#t~ite43_Out1139390717|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1139390717, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1139390717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1139390717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139390717} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1139390717, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1139390717, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1139390717|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1139390717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1139390717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:08:22,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In143221292 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In143221292 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In143221292 |ULTIMATE.start_main_#t~ite44_Out143221292|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out143221292|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In143221292, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In143221292} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In143221292, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In143221292, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out143221292|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:08:22,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-705304329 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-705304329 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-705304329 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-705304329 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-705304329| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-705304329| ~y$r_buff1_thd0~0_In-705304329) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-705304329, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-705304329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-705304329, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-705304329} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-705304329, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-705304329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-705304329, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-705304329|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-705304329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:08:22,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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:08:22,824 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_adbedd32-4ca5-49ac-8a7d-48e87cb66c32/bin/uautomizer/witness.graphml [2019-12-07 17:08:22,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:08:22,826 INFO L168 Benchmark]: Toolchain (without parser) took 22524.26 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 444.6 MB). Free memory was 942.3 MB in the beginning and 803.3 MB in the end (delta: 139.0 MB). Peak memory consumption was 583.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:08:22,826 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:08:22,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:08:22,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:08:22,827 INFO L168 Benchmark]: Boogie Preprocessor took 24.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:08:22,827 INFO L168 Benchmark]: RCFGBuilder took 387.97 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.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:08:22,827 INFO L168 Benchmark]: TraceAbstraction took 21621.29 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 1.0 GB in the beginning and 831.8 MB in the end (delta: 182.1 MB). Peak memory consumption was 529.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:08:22,828 INFO L168 Benchmark]: Witness Printer took 68.27 ms. Allocated memory is still 1.5 GB. Free memory was 831.8 MB in the beginning and 803.3 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:08:22,829 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 942.3 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 387.97 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.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21621.29 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 1.0 GB in the beginning and 831.8 MB in the end (delta: 182.1 MB). Peak memory consumption was 529.7 MB. Max. memory is 11.5 GB. * Witness Printer took 68.27 ms. Allocated memory is still 1.5 GB. Free memory was 831.8 MB in the beginning and 803.3 MB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t591, ((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 [L799] FCALL, FORK 0 pthread_create(&t592, ((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 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, 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] [L762] 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=2, __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=2, 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) [L762] 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) [L763] 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)) [L764] 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)) [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$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)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, 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] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, 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] [L774] 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=1, __unbuffered_p1_EAX=2, __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=2, 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] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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 [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, 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] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 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: 21.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2562 SDtfs, 4593 SDslu, 7627 SDs, 0 SdLazy, 9216 SolverSat, 561 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 43 SyntacticMatches, 15 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8545 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 15305 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 710 NumberOfCodeBlocks, 710 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 640 ConstructedInterpolants, 0 QuantifiedInterpolants, 144852 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...