./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/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix022_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-11-28 18:07:45,173 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:07:45,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:07:45,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:07:45,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:07:45,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:07:45,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:07:45,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:07:45,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:07:45,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:07:45,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:07:45,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:07:45,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:07:45,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:07:45,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:07:45,227 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:07:45,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:07:45,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:07:45,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:07:45,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:07:45,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:07:45,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:07:45,252 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:07:45,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:07:45,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:07:45,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:07:45,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:07:45,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:07:45,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:07:45,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:07:45,264 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:07:45,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:07:45,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:07:45,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:07:45,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:07:45,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:07:45,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:07:45,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:07:45,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:07:45,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:07:45,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:07:45,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:07:45,313 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:07:45,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:07:45,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:07:45,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:07:45,321 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:07:45,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:07:45,322 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:07:45,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:07:45,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:07:45,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:07:45,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:07:45,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:07:45,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:07:45,325 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:07:45,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:07:45,325 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:07:45,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:07:45,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:07:45,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:07:45,326 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:07:45,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:07:45,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:07:45,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:07:45,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:07:45,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:07:45,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:07:45,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:07:45,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:07:45,330 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:07:45,330 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-11-28 18:07:45,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:07:45,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:07:45,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:07:45,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:07:45,709 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:07:45,710 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix022_pso.opt.i [2019-11-28 18:07:45,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0927aa105/79a972826afc48c489b2637d566467e2/FLAG03036ea00 [2019-11-28 18:07:46,273 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:07:46,274 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_pso.opt.i [2019-11-28 18:07:46,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0927aa105/79a972826afc48c489b2637d566467e2/FLAG03036ea00 [2019-11-28 18:07:46,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0927aa105/79a972826afc48c489b2637d566467e2 [2019-11-28 18:07:46,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:07:46,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:07:46,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:07:46,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:07:46,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:07:46,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:46" (1/1) ... [2019-11-28 18:07:46,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a736f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:46, skipping insertion in model container [2019-11-28 18:07:46,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:46" (1/1) ... [2019-11-28 18:07:46,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:07:46,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:07:47,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:07:47,349 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:07:47,432 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:07:47,506 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:07:47,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47 WrapperNode [2019-11-28 18:07:47,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:07:47,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:07:47,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:07:47,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:07:47,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:07:47,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:07:47,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:07:47,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:07:47,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... [2019-11-28 18:07:47,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:07:47,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:07:47,623 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:07:47,623 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:07:47,624 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:07:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:07:47,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:07:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:07:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:07:47,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:07:47,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:07:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:07:47,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:07:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:07:47,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:07:47,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:07:47,695 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:07:48,476 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:07:48,476 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:07:48,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:48 BoogieIcfgContainer [2019-11-28 18:07:48,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:07:48,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:07:48,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:07:48,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:07:48,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:07:46" (1/3) ... [2019-11-28 18:07:48,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f52184f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:48, skipping insertion in model container [2019-11-28 18:07:48,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:47" (2/3) ... [2019-11-28 18:07:48,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f52184f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:48, skipping insertion in model container [2019-11-28 18:07:48,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:48" (3/3) ... [2019-11-28 18:07:48,492 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_pso.opt.i [2019-11-28 18:07:48,504 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:07:48,504 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:07:48,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:07:48,514 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:07:48,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,554 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,555 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,555 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,555 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,556 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,565 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,565 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:48,632 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:07:48,652 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:07:48,652 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:07:48,652 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:07:48,652 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:07:48,653 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:07:48,653 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:07:48,653 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:07:48,653 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:07:48,671 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:07:48,673 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:07:48,759 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:07:48,760 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:07:48,777 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-11-28 18:07:48,801 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:07:48,851 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:07:48,851 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:07:48,867 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-11-28 18:07:48,896 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:07:48,898 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:07:53,508 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-28 18:07:53,939 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:07:54,054 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:07:54,092 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-11-28 18:07:54,092 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-11-28 18:07:54,095 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-11-28 18:07:54,611 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-11-28 18:07:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-11-28 18:07:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:07:54,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:54,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:07:54,622 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-11-28 18:07:54,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:54,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001152348] [2019-11-28 18:07:54,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:54,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001152348] [2019-11-28 18:07:54,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:54,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:07:54,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712203244] [2019-11-28 18:07:54,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:07:54,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:54,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:07:54,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:07:54,888 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-11-28 18:07:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:55,152 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-11-28 18:07:55,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:07:55,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:07:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:55,253 INFO L225 Difference]: With dead ends: 8468 [2019-11-28 18:07:55,254 INFO L226 Difference]: Without dead ends: 7976 [2019-11-28 18:07:55,255 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-11-28 18:07:55,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-11-28 18:07:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-11-28 18:07:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-11-28 18:07:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-11-28 18:07:55,753 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-11-28 18:07:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:55,754 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-11-28 18:07:55,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:07:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-11-28 18:07:55,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:07:55,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:55,759 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:55,760 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:55,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:55,761 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-11-28 18:07:55,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:55,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916641649] [2019-11-28 18:07:55,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:55,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916641649] [2019-11-28 18:07:55,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:55,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:07:55,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103284913] [2019-11-28 18:07:55,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:07:55,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:07:55,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:55,946 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-11-28 18:07:56,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:56,022 INFO L93 Difference]: Finished difference Result 1834 states and 4623 transitions. [2019-11-28 18:07:56,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:07:56,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:07:56,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:56,034 INFO L225 Difference]: With dead ends: 1834 [2019-11-28 18:07:56,034 INFO L226 Difference]: Without dead ends: 1342 [2019-11-28 18:07:56,035 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-11-28 18:07:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-11-28 18:07:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2019-11-28 18:07:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-11-28 18:07:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3045 transitions. [2019-11-28 18:07:56,083 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3045 transitions. Word has length 11 [2019-11-28 18:07:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:56,083 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 3045 transitions. [2019-11-28 18:07:56,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3045 transitions. [2019-11-28 18:07:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:07:56,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:56,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:56,090 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:56,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:56,091 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-11-28 18:07:56,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:56,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116917946] [2019-11-28 18:07:56,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:56,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116917946] [2019-11-28 18:07:56,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:56,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:07:56,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993187348] [2019-11-28 18:07:56,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:07:56,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:07:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:56,228 INFO L87 Difference]: Start difference. First operand 1342 states and 3045 transitions. Second operand 4 states. [2019-11-28 18:07:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:56,479 INFO L93 Difference]: Finished difference Result 1673 states and 3729 transitions. [2019-11-28 18:07:56,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:07:56,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:07:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:56,494 INFO L225 Difference]: With dead ends: 1673 [2019-11-28 18:07:56,494 INFO L226 Difference]: Without dead ends: 1673 [2019-11-28 18:07:56,495 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-11-28 18:07:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-11-28 18:07:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1609. [2019-11-28 18:07:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-11-28 18:07:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3605 transitions. [2019-11-28 18:07:56,563 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3605 transitions. Word has length 14 [2019-11-28 18:07:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:56,565 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3605 transitions. [2019-11-28 18:07:56,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3605 transitions. [2019-11-28 18:07:56,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:07:56,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:56,570 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-11-28 18:07:56,570 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:56,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:56,571 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-11-28 18:07:56,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:56,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701589002] [2019-11-28 18:07:56,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:56,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701589002] [2019-11-28 18:07:56,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:56,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:07:56,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244750485] [2019-11-28 18:07:56,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:07:56,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:56,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:07:56,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:07:56,718 INFO L87 Difference]: Start difference. First operand 1609 states and 3605 transitions. Second operand 6 states. [2019-11-28 18:07:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:57,620 INFO L93 Difference]: Finished difference Result 4481 states and 9905 transitions. [2019-11-28 18:07:57,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:07:57,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:07:57,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:57,646 INFO L225 Difference]: With dead ends: 4481 [2019-11-28 18:07:57,646 INFO L226 Difference]: Without dead ends: 4446 [2019-11-28 18:07:57,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:07:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-11-28 18:07:57,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2169. [2019-11-28 18:07:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-11-28 18:07:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 4909 transitions. [2019-11-28 18:07:57,728 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 4909 transitions. Word has length 25 [2019-11-28 18:07:57,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:57,728 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 4909 transitions. [2019-11-28 18:07:57,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:07:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 4909 transitions. [2019-11-28 18:07:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:07:57,732 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:57,733 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-11-28 18:07:57,733 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:57,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash -662536504, now seen corresponding path program 1 times [2019-11-28 18:07:57,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:57,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128635022] [2019-11-28 18:07:57,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:57,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128635022] [2019-11-28 18:07:57,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:57,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:07:57,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957517247] [2019-11-28 18:07:57,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:07:57,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:07:57,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:07:57,860 INFO L87 Difference]: Start difference. First operand 2169 states and 4909 transitions. Second operand 5 states. [2019-11-28 18:07:58,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:58,460 INFO L93 Difference]: Finished difference Result 3139 states and 6955 transitions. [2019-11-28 18:07:58,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:07:58,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:07:58,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:58,492 INFO L225 Difference]: With dead ends: 3139 [2019-11-28 18:07:58,492 INFO L226 Difference]: Without dead ends: 3139 [2019-11-28 18:07:58,493 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-11-28 18:07:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-11-28 18:07:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2639. [2019-11-28 18:07:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-11-28 18:07:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 5924 transitions. [2019-11-28 18:07:58,601 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 5924 transitions. Word has length 26 [2019-11-28 18:07:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:58,602 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 5924 transitions. [2019-11-28 18:07:58,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:07:58,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 5924 transitions. [2019-11-28 18:07:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:07:58,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:58,608 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-11-28 18:07:58,609 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-11-28 18:07:58,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:58,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709691935] [2019-11-28 18:07:58,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:58,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:07:58,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709691935] [2019-11-28 18:07:58,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:58,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:07:58,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004110714] [2019-11-28 18:07:58,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:07:58,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:58,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:07:58,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:07:58,777 INFO L87 Difference]: Start difference. First operand 2639 states and 5924 transitions. Second operand 6 states. [2019-11-28 18:07:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:59,477 INFO L93 Difference]: Finished difference Result 5512 states and 12000 transitions. [2019-11-28 18:07:59,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:07:59,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 18:07:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:59,502 INFO L225 Difference]: With dead ends: 5512 [2019-11-28 18:07:59,502 INFO L226 Difference]: Without dead ends: 5483 [2019-11-28 18:07:59,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:07:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2019-11-28 18:07:59,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 2614. [2019-11-28 18:07:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2019-11-28 18:07:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 5890 transitions. [2019-11-28 18:07:59,631 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 5890 transitions. Word has length 26 [2019-11-28 18:07:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:59,631 INFO L462 AbstractCegarLoop]: Abstraction has 2614 states and 5890 transitions. [2019-11-28 18:07:59,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:07:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 5890 transitions. [2019-11-28 18:07:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:07:59,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:59,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] [2019-11-28 18:07:59,637 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:59,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:59,637 INFO L82 PathProgramCache]: Analyzing trace with hash -312964189, now seen corresponding path program 1 times [2019-11-28 18:07:59,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:59,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706102867] [2019-11-28 18:07:59,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:59,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-11-28 18:07:59,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706102867] [2019-11-28 18:07:59,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:59,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:07:59,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99046123] [2019-11-28 18:07:59,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:07:59,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:59,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:07:59,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:59,755 INFO L87 Difference]: Start difference. First operand 2614 states and 5890 transitions. Second operand 4 states. [2019-11-28 18:07:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:59,800 INFO L93 Difference]: Finished difference Result 4752 states and 10724 transitions. [2019-11-28 18:07:59,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:07:59,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:07:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:59,812 INFO L225 Difference]: With dead ends: 4752 [2019-11-28 18:07:59,813 INFO L226 Difference]: Without dead ends: 4012 [2019-11-28 18:07:59,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2019-11-28 18:07:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 3996. [2019-11-28 18:07:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3996 states. [2019-11-28 18:07:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3996 states to 3996 states and 9096 transitions. [2019-11-28 18:07:59,926 INFO L78 Accepts]: Start accepts. Automaton has 3996 states and 9096 transitions. Word has length 27 [2019-11-28 18:07:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:59,928 INFO L462 AbstractCegarLoop]: Abstraction has 3996 states and 9096 transitions. [2019-11-28 18:07:59,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3996 states and 9096 transitions. [2019-11-28 18:07:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:07:59,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:59,942 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:59,942 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:59,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash -5510903, now seen corresponding path program 1 times [2019-11-28 18:07:59,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:59,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004087400] [2019-11-28 18:07:59,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:00,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004087400] [2019-11-28 18:08:00,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:00,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:08:00,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460008285] [2019-11-28 18:08:00,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:08:00,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:00,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:08:00,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:08:00,065 INFO L87 Difference]: Start difference. First operand 3996 states and 9096 transitions. Second operand 5 states. [2019-11-28 18:08:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:00,138 INFO L93 Difference]: Finished difference Result 2427 states and 5306 transitions. [2019-11-28 18:08:00,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:08:00,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:08:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:00,146 INFO L225 Difference]: With dead ends: 2427 [2019-11-28 18:08:00,147 INFO L226 Difference]: Without dead ends: 2163 [2019-11-28 18:08:00,148 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-11-28 18:08:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2019-11-28 18:08:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1308. [2019-11-28 18:08:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-11-28 18:08:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2862 transitions. [2019-11-28 18:08:00,193 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2862 transitions. Word has length 28 [2019-11-28 18:08:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:00,194 INFO L462 AbstractCegarLoop]: Abstraction has 1308 states and 2862 transitions. [2019-11-28 18:08:00,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:08:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2862 transitions. [2019-11-28 18:08:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:08:00,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:00,201 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-11-28 18:08:00,202 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:00,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash 62245946, now seen corresponding path program 1 times [2019-11-28 18:08:00,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:00,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096767612] [2019-11-28 18:08:00,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:00,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096767612] [2019-11-28 18:08:00,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:00,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:08:00,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298595490] [2019-11-28 18:08:00,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:08:00,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:08:00,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:00,330 INFO L87 Difference]: Start difference. First operand 1308 states and 2862 transitions. Second operand 3 states. [2019-11-28 18:08:00,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:00,403 INFO L93 Difference]: Finished difference Result 1701 states and 3674 transitions. [2019-11-28 18:08:00,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:08:00,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:08:00,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:00,408 INFO L225 Difference]: With dead ends: 1701 [2019-11-28 18:08:00,409 INFO L226 Difference]: Without dead ends: 1701 [2019-11-28 18:08:00,409 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-11-28 18:08:00,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2019-11-28 18:08:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1376. [2019-11-28 18:08:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2019-11-28 18:08:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 3024 transitions. [2019-11-28 18:08:00,445 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 3024 transitions. Word has length 51 [2019-11-28 18:08:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:00,446 INFO L462 AbstractCegarLoop]: Abstraction has 1376 states and 3024 transitions. [2019-11-28 18:08:00,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:08:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 3024 transitions. [2019-11-28 18:08:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:00,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:00,450 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-11-28 18:08:00,450 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:00,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:00,451 INFO L82 PathProgramCache]: Analyzing trace with hash -972871791, now seen corresponding path program 1 times [2019-11-28 18:08:00,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:00,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170372743] [2019-11-28 18:08:00,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:00,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170372743] [2019-11-28 18:08:00,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:00,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:08:00,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704387308] [2019-11-28 18:08:00,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:08:00,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:00,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:08:00,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:08:00,630 INFO L87 Difference]: Start difference. First operand 1376 states and 3024 transitions. Second operand 8 states. [2019-11-28 18:08:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:02,126 INFO L93 Difference]: Finished difference Result 2975 states and 6306 transitions. [2019-11-28 18:08:02,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 18:08:02,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-11-28 18:08:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:02,135 INFO L225 Difference]: With dead ends: 2975 [2019-11-28 18:08:02,135 INFO L226 Difference]: Without dead ends: 2975 [2019-11-28 18:08:02,136 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-11-28 18:08:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2019-11-28 18:08:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 1387. [2019-11-28 18:08:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1387 states. [2019-11-28 18:08:02,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 3034 transitions. [2019-11-28 18:08:02,191 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 3034 transitions. Word has length 52 [2019-11-28 18:08:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:02,191 INFO L462 AbstractCegarLoop]: Abstraction has 1387 states and 3034 transitions. [2019-11-28 18:08:02,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:08:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 3034 transitions. [2019-11-28 18:08:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:02,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:02,197 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-11-28 18:08:02,197 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1641556840, now seen corresponding path program 1 times [2019-11-28 18:08:02,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:02,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931434693] [2019-11-28 18:08:02,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:02,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931434693] [2019-11-28 18:08:02,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:02,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:08:02,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845607332] [2019-11-28 18:08:02,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:08:02,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:02,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:08:02,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:08:02,324 INFO L87 Difference]: Start difference. First operand 1387 states and 3034 transitions. Second operand 7 states. [2019-11-28 18:08:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:03,513 INFO L93 Difference]: Finished difference Result 2755 states and 5763 transitions. [2019-11-28 18:08:03,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 18:08:03,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:08:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:03,527 INFO L225 Difference]: With dead ends: 2755 [2019-11-28 18:08:03,527 INFO L226 Difference]: Without dead ends: 2755 [2019-11-28 18:08:03,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-28 18:08:03,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-28 18:08:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 1422. [2019-11-28 18:08:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-11-28 18:08:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 3113 transitions. [2019-11-28 18:08:03,572 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 3113 transitions. Word has length 52 [2019-11-28 18:08:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:03,573 INFO L462 AbstractCegarLoop]: Abstraction has 1422 states and 3113 transitions. [2019-11-28 18:08:03,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:08:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 3113 transitions. [2019-11-28 18:08:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:03,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:03,578 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-11-28 18:08:03,578 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:03,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:03,579 INFO L82 PathProgramCache]: Analyzing trace with hash 843046701, now seen corresponding path program 2 times [2019-11-28 18:08:03,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:03,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927119793] [2019-11-28 18:08:03,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:03,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927119793] [2019-11-28 18:08:03,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:03,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:08:03,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456036625] [2019-11-28 18:08:03,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:08:03,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:03,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:08:03,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:08:03,813 INFO L87 Difference]: Start difference. First operand 1422 states and 3113 transitions. Second operand 9 states. [2019-11-28 18:08:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:06,004 INFO L93 Difference]: Finished difference Result 11751 states and 25051 transitions. [2019-11-28 18:08:06,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-11-28 18:08:06,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-11-28 18:08:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:06,029 INFO L225 Difference]: With dead ends: 11751 [2019-11-28 18:08:06,029 INFO L226 Difference]: Without dead ends: 8618 [2019-11-28 18:08:06,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=547, Invalid=1805, Unknown=0, NotChecked=0, Total=2352 [2019-11-28 18:08:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8618 states. [2019-11-28 18:08:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8618 to 1689. [2019-11-28 18:08:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2019-11-28 18:08:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 3687 transitions. [2019-11-28 18:08:06,131 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 3687 transitions. Word has length 52 [2019-11-28 18:08:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:06,132 INFO L462 AbstractCegarLoop]: Abstraction has 1689 states and 3687 transitions. [2019-11-28 18:08:06,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:08:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 3687 transitions. [2019-11-28 18:08:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:06,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:06,138 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-11-28 18:08:06,138 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:06,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:06,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1165405280, now seen corresponding path program 2 times [2019-11-28 18:08:06,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:06,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555493555] [2019-11-28 18:08:06,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:06,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555493555] [2019-11-28 18:08:06,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:06,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:08:06,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117097527] [2019-11-28 18:08:06,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:08:06,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:06,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:08:06,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:08:06,266 INFO L87 Difference]: Start difference. First operand 1689 states and 3687 transitions. Second operand 4 states. [2019-11-28 18:08:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:06,333 INFO L93 Difference]: Finished difference Result 1669 states and 3634 transitions. [2019-11-28 18:08:06,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:08:06,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-28 18:08:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:06,338 INFO L225 Difference]: With dead ends: 1669 [2019-11-28 18:08:06,339 INFO L226 Difference]: Without dead ends: 1669 [2019-11-28 18:08:06,339 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-11-28 18:08:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-11-28 18:08:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1575. [2019-11-28 18:08:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2019-11-28 18:08:06,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 3419 transitions. [2019-11-28 18:08:06,373 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 3419 transitions. Word has length 52 [2019-11-28 18:08:06,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:06,373 INFO L462 AbstractCegarLoop]: Abstraction has 1575 states and 3419 transitions. [2019-11-28 18:08:06,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:08:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 3419 transitions. [2019-11-28 18:08:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:06,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:06,378 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-11-28 18:08:06,379 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:06,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:06,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1952234998, now seen corresponding path program 1 times [2019-11-28 18:08:06,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:06,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760766835] [2019-11-28 18:08:06,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:06,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760766835] [2019-11-28 18:08:06,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:06,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:08:06,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258704693] [2019-11-28 18:08:06,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:08:06,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:06,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:08:06,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:06,443 INFO L87 Difference]: Start difference. First operand 1575 states and 3419 transitions. Second operand 3 states. [2019-11-28 18:08:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:06,485 INFO L93 Difference]: Finished difference Result 1943 states and 4058 transitions. [2019-11-28 18:08:06,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:08:06,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:08:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:06,491 INFO L225 Difference]: With dead ends: 1943 [2019-11-28 18:08:06,492 INFO L226 Difference]: Without dead ends: 1903 [2019-11-28 18:08:06,493 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-11-28 18:08:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-11-28 18:08:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1501. [2019-11-28 18:08:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-11-28 18:08:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 3211 transitions. [2019-11-28 18:08:06,528 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 3211 transitions. Word has length 52 [2019-11-28 18:08:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:06,528 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 3211 transitions. [2019-11-28 18:08:06,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:08:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 3211 transitions. [2019-11-28 18:08:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:06,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:06,536 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-11-28 18:08:06,537 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:06,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2030779203, now seen corresponding path program 3 times [2019-11-28 18:08:06,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:06,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560176666] [2019-11-28 18:08:06,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:06,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560176666] [2019-11-28 18:08:06,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:06,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:08:06,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448109214] [2019-11-28 18:08:06,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:08:06,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:06,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:08:06,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:08:06,688 INFO L87 Difference]: Start difference. First operand 1501 states and 3211 transitions. Second operand 9 states. [2019-11-28 18:08:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:08,101 INFO L93 Difference]: Finished difference Result 7616 states and 15372 transitions. [2019-11-28 18:08:08,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-28 18:08:08,102 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-11-28 18:08:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:08,109 INFO L225 Difference]: With dead ends: 7616 [2019-11-28 18:08:08,110 INFO L226 Difference]: Without dead ends: 5053 [2019-11-28 18:08:08,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 18:08:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5053 states. [2019-11-28 18:08:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5053 to 1546. [2019-11-28 18:08:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-11-28 18:08:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 3304 transitions. [2019-11-28 18:08:08,169 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 3304 transitions. Word has length 52 [2019-11-28 18:08:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:08,169 INFO L462 AbstractCegarLoop]: Abstraction has 1546 states and 3304 transitions. [2019-11-28 18:08:08,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:08:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 3304 transitions. [2019-11-28 18:08:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:08,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:08,175 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-11-28 18:08:08,176 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:08,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:08,176 INFO L82 PathProgramCache]: Analyzing trace with hash -113989563, now seen corresponding path program 4 times [2019-11-28 18:08:08,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:08,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515268064] [2019-11-28 18:08:08,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:08,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515268064] [2019-11-28 18:08:08,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:08,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:08:08,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064013047] [2019-11-28 18:08:08,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:08:08,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:08,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:08:08,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:08:08,507 INFO L87 Difference]: Start difference. First operand 1546 states and 3304 transitions. Second operand 12 states. [2019-11-28 18:08:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:09,799 INFO L93 Difference]: Finished difference Result 2512 states and 5153 transitions. [2019-11-28 18:08:09,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 18:08:09,800 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-11-28 18:08:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:09,804 INFO L225 Difference]: With dead ends: 2512 [2019-11-28 18:08:09,804 INFO L226 Difference]: Without dead ends: 2498 [2019-11-28 18:08:09,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-11-28 18:08:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2019-11-28 18:08:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 1353. [2019-11-28 18:08:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2019-11-28 18:08:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2848 transitions. [2019-11-28 18:08:09,836 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2848 transitions. Word has length 52 [2019-11-28 18:08:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:09,836 INFO L462 AbstractCegarLoop]: Abstraction has 1353 states and 2848 transitions. [2019-11-28 18:08:09,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:08:09,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2848 transitions. [2019-11-28 18:08:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:09,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:09,841 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-11-28 18:08:09,841 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:09,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:09,842 INFO L82 PathProgramCache]: Analyzing trace with hash -364522171, now seen corresponding path program 5 times [2019-11-28 18:08:09,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:09,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518294947] [2019-11-28 18:08:09,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:10,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518294947] [2019-11-28 18:08:10,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:10,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 18:08:10,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131994440] [2019-11-28 18:08:10,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:08:10,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:10,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:08:10,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:08:10,109 INFO L87 Difference]: Start difference. First operand 1353 states and 2848 transitions. Second operand 10 states. [2019-11-28 18:08:11,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:11,416 INFO L93 Difference]: Finished difference Result 2600 states and 5290 transitions. [2019-11-28 18:08:11,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 18:08:11,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-28 18:08:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:11,420 INFO L225 Difference]: With dead ends: 2600 [2019-11-28 18:08:11,420 INFO L226 Difference]: Without dead ends: 2600 [2019-11-28 18:08:11,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-11-28 18:08:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2019-11-28 18:08:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 1315. [2019-11-28 18:08:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2019-11-28 18:08:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 2775 transitions. [2019-11-28 18:08:11,458 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 2775 transitions. Word has length 52 [2019-11-28 18:08:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:11,458 INFO L462 AbstractCegarLoop]: Abstraction has 1315 states and 2775 transitions. [2019-11-28 18:08:11,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:08:11,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 2775 transitions. [2019-11-28 18:08:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:11,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:11,464 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-11-28 18:08:11,464 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:11,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:11,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1256700525, now seen corresponding path program 6 times [2019-11-28 18:08:11,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:11,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543293143] [2019-11-28 18:08:11,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:11,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543293143] [2019-11-28 18:08:11,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:11,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:08:11,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730713178] [2019-11-28 18:08:11,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:08:11,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:11,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:08:11,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:11,536 INFO L87 Difference]: Start difference. First operand 1315 states and 2775 transitions. Second operand 3 states. [2019-11-28 18:08:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:11,551 INFO L93 Difference]: Finished difference Result 2235 states and 4669 transitions. [2019-11-28 18:08:11,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:08:11,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:08:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:11,554 INFO L225 Difference]: With dead ends: 2235 [2019-11-28 18:08:11,554 INFO L226 Difference]: Without dead ends: 959 [2019-11-28 18:08:11,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-11-28 18:08:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 959. [2019-11-28 18:08:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 959 states. [2019-11-28 18:08:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1964 transitions. [2019-11-28 18:08:11,574 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1964 transitions. Word has length 52 [2019-11-28 18:08:11,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:11,575 INFO L462 AbstractCegarLoop]: Abstraction has 959 states and 1964 transitions. [2019-11-28 18:08:11,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:08:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1964 transitions. [2019-11-28 18:08:11,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:11,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:11,581 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-11-28 18:08:11,581 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:11,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:11,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1250007013, now seen corresponding path program 7 times [2019-11-28 18:08:11,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:11,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610550055] [2019-11-28 18:08:11,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:11,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610550055] [2019-11-28 18:08:11,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:11,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:08:11,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174812025] [2019-11-28 18:08:11,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:08:11,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:11,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:08:11,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:08:11,666 INFO L87 Difference]: Start difference. First operand 959 states and 1964 transitions. Second operand 7 states. [2019-11-28 18:08:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:11,818 INFO L93 Difference]: Finished difference Result 1804 states and 3602 transitions. [2019-11-28 18:08:11,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:08:11,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:08:11,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:11,821 INFO L225 Difference]: With dead ends: 1804 [2019-11-28 18:08:11,821 INFO L226 Difference]: Without dead ends: 1182 [2019-11-28 18:08:11,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:08:11,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2019-11-28 18:08:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 935. [2019-11-28 18:08:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-11-28 18:08:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1914 transitions. [2019-11-28 18:08:11,839 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1914 transitions. Word has length 52 [2019-11-28 18:08:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:11,840 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 1914 transitions. [2019-11-28 18:08:11,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:08:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1914 transitions. [2019-11-28 18:08:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:11,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:11,843 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-11-28 18:08:11,843 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:11,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:11,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1247011877, now seen corresponding path program 8 times [2019-11-28 18:08:11,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:11,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072396709] [2019-11-28 18:08:11,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:08:11,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072396709] [2019-11-28 18:08:11,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:11,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:08:11,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045546522] [2019-11-28 18:08:11,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:08:11,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:11,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:08:11,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:11,923 INFO L87 Difference]: Start difference. First operand 935 states and 1914 transitions. Second operand 3 states. [2019-11-28 18:08:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:11,936 INFO L93 Difference]: Finished difference Result 934 states and 1912 transitions. [2019-11-28 18:08:11,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:08:11,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:08:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:11,938 INFO L225 Difference]: With dead ends: 934 [2019-11-28 18:08:11,939 INFO L226 Difference]: Without dead ends: 934 [2019-11-28 18:08:11,939 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-11-28 18:08:11,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-11-28 18:08:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 678. [2019-11-28 18:08:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-11-28 18:08:11,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1408 transitions. [2019-11-28 18:08:11,953 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1408 transitions. Word has length 52 [2019-11-28 18:08:11,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:11,954 INFO L462 AbstractCegarLoop]: Abstraction has 678 states and 1408 transitions. [2019-11-28 18:08:11,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:08:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1408 transitions. [2019-11-28 18:08:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:08:11,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:11,956 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-11-28 18:08:11,956 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:11,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:11,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-11-28 18:08:11,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:11,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254093088] [2019-11-28 18:08:11,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:08:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:08:12,107 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:08:12,107 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:08:12,111 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-11-28 18:08:12,112 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-11-28 18:08:12,113 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-11-28 18:08:12,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1445204711 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1445204711 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1445204711| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1445204711| ~y$w_buff0_used~0_In1445204711)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1445204711, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1445204711} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1445204711|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1445204711, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1445204711} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:08:12,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1570503531 256) 0))) (or (and (= ~y$w_buff0~0_In1570503531 |P1Thread1of1ForFork1_#t~ite15_Out1570503531|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1570503531| |P1Thread1of1ForFork1_#t~ite14_Out1570503531|)) (and .cse0 (= ~y$w_buff0~0_In1570503531 |P1Thread1of1ForFork1_#t~ite14_Out1570503531|) (= |P1Thread1of1ForFork1_#t~ite14_Out1570503531| |P1Thread1of1ForFork1_#t~ite15_Out1570503531|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1570503531 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1570503531 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1570503531 256))) (= 0 (mod ~y$w_buff0_used~0_In1570503531 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570503531, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570503531, ~y$w_buff0~0=~y$w_buff0~0_In1570503531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570503531, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1570503531|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570503531} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570503531, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570503531, ~y$w_buff0~0=~y$w_buff0~0_In1570503531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570503531, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1570503531|, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1570503531|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570503531} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:08:12,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In597800782 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In597800782| |P1Thread1of1ForFork1_#t~ite17_Out597800782|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out597800782| ~y$w_buff1~0_In597800782)) (and (= ~y$w_buff1~0_In597800782 |P1Thread1of1ForFork1_#t~ite17_Out597800782|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In597800782 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In597800782 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In597800782 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In597800782 256))))) (= |P1Thread1of1ForFork1_#t~ite18_Out597800782| |P1Thread1of1ForFork1_#t~ite17_Out597800782|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597800782, ~y$w_buff1~0=~y$w_buff1~0_In597800782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597800782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597800782, ~weak$$choice2~0=~weak$$choice2~0_In597800782, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In597800782|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597800782, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out597800782|, ~y$w_buff1~0=~y$w_buff1~0_In597800782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597800782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597800782, ~weak$$choice2~0=~weak$$choice2~0_In597800782, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out597800782|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:08:12,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-590966226 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-590966226 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-590966226 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-590966226 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-590966226 |P0Thread1of1ForFork0_#t~ite6_Out-590966226|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-590966226|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-590966226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-590966226, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-590966226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-590966226} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-590966226|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-590966226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-590966226, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-590966226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-590966226} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:08:12,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In-1917796579 ~y$r_buff0_thd1~0_Out-1917796579)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1917796579 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1917796579 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-1917796579)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917796579, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1917796579} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917796579, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1917796579|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1917796579} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:08:12,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1478647122 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1478647122 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1478647122 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1478647122 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1478647122| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out1478647122| ~y$r_buff1_thd1~0_In1478647122) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1478647122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1478647122, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1478647122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1478647122} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1478647122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1478647122, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1478647122|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1478647122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1478647122} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:08:12,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2132940669 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2132940669 |P1Thread1of1ForFork1_#t~ite20_Out-2132940669|) .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-2132940669| |P1Thread1of1ForFork1_#t~ite20_Out-2132940669|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2132940669 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2132940669 256))) (= (mod ~y$w_buff0_used~0_In-2132940669 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-2132940669 256)) .cse1)))) (and (= ~y$w_buff0_used~0_In-2132940669 |P1Thread1of1ForFork1_#t~ite21_Out-2132940669|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-2132940669| |P1Thread1of1ForFork1_#t~ite20_Out-2132940669|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2132940669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132940669, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2132940669|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2132940669, ~weak$$choice2~0=~weak$$choice2~0_In-2132940669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132940669} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2132940669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132940669, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2132940669|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2132940669, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2132940669|, ~weak$$choice2~0=~weak$$choice2~0_In-2132940669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132940669} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:08:12,121 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-11-28 18:08:12,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2120013689 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-2120013689| ~y$r_buff1_thd2~0_In-2120013689) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2120013689 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-2120013689 256))) (and (= (mod ~y$r_buff1_thd2~0_In-2120013689 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-2120013689 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out-2120013689| |P1Thread1of1ForFork1_#t~ite30_Out-2120013689|)) (and (= ~y$r_buff1_thd2~0_In-2120013689 |P1Thread1of1ForFork1_#t~ite30_Out-2120013689|) (= |P1Thread1of1ForFork1_#t~ite29_In-2120013689| |P1Thread1of1ForFork1_#t~ite29_Out-2120013689|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120013689, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2120013689|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120013689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120013689, ~weak$$choice2~0=~weak$$choice2~0_In-2120013689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120013689} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120013689, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2120013689|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2120013689|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120013689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120013689, ~weak$$choice2~0=~weak$$choice2~0_In-2120013689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120013689} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:08:12,122 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-11-28 18:08:12,123 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-11-28 18:08:12,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1475939382 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1475939382 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1475939382 |P1Thread1of1ForFork1_#t~ite32_Out1475939382|)) (and (or .cse1 .cse0) (= ~y~0_In1475939382 |P1Thread1of1ForFork1_#t~ite32_Out1475939382|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1475939382, ~y$w_buff1~0=~y$w_buff1~0_In1475939382, ~y~0=~y~0_In1475939382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1475939382} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1475939382, ~y$w_buff1~0=~y$w_buff1~0_In1475939382, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1475939382|, ~y~0=~y~0_In1475939382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1475939382} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:08:12,123 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-11-28 18:08:12,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1712978252 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1712978252 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1712978252| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1712978252| ~y$w_buff0_used~0_In1712978252)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1712978252, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1712978252} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1712978252, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1712978252, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1712978252|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:08:12,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In817479783 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In817479783 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In817479783 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In817479783 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out817479783| ~y$w_buff1_used~0_In817479783) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out817479783| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817479783, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817479783, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817479783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817479783} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817479783, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817479783, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817479783, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out817479783|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817479783} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:08:12,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1138839504 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1138839504 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1138839504| ~y$r_buff0_thd2~0_In-1138839504) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1138839504| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1138839504, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1138839504} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1138839504, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1138839504, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1138839504|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:08:12,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In1114368751 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1114368751 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1114368751 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1114368751 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1114368751| ~y$r_buff1_thd2~0_In1114368751) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1114368751| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1114368751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1114368751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1114368751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1114368751, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1114368751|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:12,126 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-11-28 18:08:12,126 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-11-28 18:08:12,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In344923534 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In344923534 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In344923534 |ULTIMATE.start_main_#t~ite40_Out344923534|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out344923534| ~y~0_In344923534) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In344923534, ~y~0=~y~0_In344923534, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In344923534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344923534} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out344923534|, ~y$w_buff1~0=~y$w_buff1~0_In344923534, ~y~0=~y~0_In344923534, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In344923534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344923534} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:08:12,127 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-11-28 18:08:12,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2086063597 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2086063597 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out2086063597| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2086063597 |ULTIMATE.start_main_#t~ite42_Out2086063597|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2086063597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2086063597} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2086063597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2086063597, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2086063597|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:08:12,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1403330770 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1403330770 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1403330770 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1403330770 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1403330770| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out1403330770| ~y$w_buff1_used~0_In1403330770) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1403330770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1403330770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1403330770} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1403330770, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1403330770|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1403330770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1403330770} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:08:12,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1275925583 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1275925583 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1275925583 |ULTIMATE.start_main_#t~ite44_Out-1275925583|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1275925583|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275925583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275925583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1275925583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:08:12,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-460841796 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-460841796 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-460841796 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-460841796 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-460841796|)) (and (= ~y$r_buff1_thd0~0_In-460841796 |ULTIMATE.start_main_#t~ite45_Out-460841796|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460841796, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460841796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460841796, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460841796, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-460841796|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:08:12,129 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-11-28 18:08:12,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:08:12 BasicIcfg [2019-11-28 18:08:12,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:08:12,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:08:12,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:08:12,228 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:08:12,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:48" (3/4) ... [2019-11-28 18:08:12,231 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:08:12,232 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-11-28 18:08:12,233 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-11-28 18:08:12,233 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-11-28 18:08:12,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1445204711 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1445204711 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1445204711| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1445204711| ~y$w_buff0_used~0_In1445204711)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1445204711, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1445204711} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1445204711|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1445204711, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1445204711} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:08:12,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1570503531 256) 0))) (or (and (= ~y$w_buff0~0_In1570503531 |P1Thread1of1ForFork1_#t~ite15_Out1570503531|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1570503531| |P1Thread1of1ForFork1_#t~ite14_Out1570503531|)) (and .cse0 (= ~y$w_buff0~0_In1570503531 |P1Thread1of1ForFork1_#t~ite14_Out1570503531|) (= |P1Thread1of1ForFork1_#t~ite14_Out1570503531| |P1Thread1of1ForFork1_#t~ite15_Out1570503531|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1570503531 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1570503531 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1570503531 256))) (= 0 (mod ~y$w_buff0_used~0_In1570503531 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570503531, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570503531, ~y$w_buff0~0=~y$w_buff0~0_In1570503531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570503531, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1570503531|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570503531} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570503531, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570503531, ~y$w_buff0~0=~y$w_buff0~0_In1570503531, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570503531, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1570503531|, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1570503531|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570503531} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:08:12,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In597800782 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In597800782| |P1Thread1of1ForFork1_#t~ite17_Out597800782|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out597800782| ~y$w_buff1~0_In597800782)) (and (= ~y$w_buff1~0_In597800782 |P1Thread1of1ForFork1_#t~ite17_Out597800782|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In597800782 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In597800782 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In597800782 256) 0) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In597800782 256))))) (= |P1Thread1of1ForFork1_#t~ite18_Out597800782| |P1Thread1of1ForFork1_#t~ite17_Out597800782|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597800782, ~y$w_buff1~0=~y$w_buff1~0_In597800782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597800782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597800782, ~weak$$choice2~0=~weak$$choice2~0_In597800782, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In597800782|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597800782, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out597800782|, ~y$w_buff1~0=~y$w_buff1~0_In597800782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597800782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597800782, ~weak$$choice2~0=~weak$$choice2~0_In597800782, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out597800782|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:08:12,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-590966226 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-590966226 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-590966226 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-590966226 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-590966226 |P0Thread1of1ForFork0_#t~ite6_Out-590966226|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-590966226|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-590966226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-590966226, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-590966226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-590966226} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-590966226|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-590966226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-590966226, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-590966226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-590966226} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:08:12,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In-1917796579 ~y$r_buff0_thd1~0_Out-1917796579)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1917796579 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1917796579 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out-1917796579)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917796579, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1917796579} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917796579, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1917796579|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1917796579} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:08:12,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1478647122 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In1478647122 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In1478647122 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1478647122 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1478647122| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out1478647122| ~y$r_buff1_thd1~0_In1478647122) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1478647122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1478647122, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1478647122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1478647122} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1478647122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1478647122, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1478647122|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1478647122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1478647122} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:08:12,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2132940669 256) 0))) (or (and (= ~y$w_buff0_used~0_In-2132940669 |P1Thread1of1ForFork1_#t~ite20_Out-2132940669|) .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-2132940669| |P1Thread1of1ForFork1_#t~ite20_Out-2132940669|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2132940669 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2132940669 256))) (= (mod ~y$w_buff0_used~0_In-2132940669 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-2132940669 256)) .cse1)))) (and (= ~y$w_buff0_used~0_In-2132940669 |P1Thread1of1ForFork1_#t~ite21_Out-2132940669|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-2132940669| |P1Thread1of1ForFork1_#t~ite20_Out-2132940669|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2132940669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132940669, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2132940669|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2132940669, ~weak$$choice2~0=~weak$$choice2~0_In-2132940669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132940669} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2132940669, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2132940669, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2132940669|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2132940669, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2132940669|, ~weak$$choice2~0=~weak$$choice2~0_In-2132940669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2132940669} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:08:12,239 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-11-28 18:08:12,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2120013689 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-2120013689| ~y$r_buff1_thd2~0_In-2120013689) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2120013689 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-2120013689 256))) (and (= (mod ~y$r_buff1_thd2~0_In-2120013689 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-2120013689 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out-2120013689| |P1Thread1of1ForFork1_#t~ite30_Out-2120013689|)) (and (= ~y$r_buff1_thd2~0_In-2120013689 |P1Thread1of1ForFork1_#t~ite30_Out-2120013689|) (= |P1Thread1of1ForFork1_#t~ite29_In-2120013689| |P1Thread1of1ForFork1_#t~ite29_Out-2120013689|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120013689, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2120013689|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120013689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120013689, ~weak$$choice2~0=~weak$$choice2~0_In-2120013689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120013689} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120013689, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2120013689|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2120013689|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120013689, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120013689, ~weak$$choice2~0=~weak$$choice2~0_In-2120013689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120013689} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:08:12,239 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-11-28 18:08:12,240 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-11-28 18:08:12,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1475939382 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1475939382 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1475939382 |P1Thread1of1ForFork1_#t~ite32_Out1475939382|)) (and (or .cse1 .cse0) (= ~y~0_In1475939382 |P1Thread1of1ForFork1_#t~ite32_Out1475939382|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1475939382, ~y$w_buff1~0=~y$w_buff1~0_In1475939382, ~y~0=~y~0_In1475939382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1475939382} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1475939382, ~y$w_buff1~0=~y$w_buff1~0_In1475939382, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1475939382|, ~y~0=~y~0_In1475939382, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1475939382} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:08:12,240 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-11-28 18:08:12,240 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1712978252 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1712978252 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1712978252| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out1712978252| ~y$w_buff0_used~0_In1712978252)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1712978252, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1712978252} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1712978252, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1712978252, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1712978252|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:08:12,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In817479783 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In817479783 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In817479783 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In817479783 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out817479783| ~y$w_buff1_used~0_In817479783) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out817479783| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817479783, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817479783, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817479783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817479783} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In817479783, ~y$w_buff0_used~0=~y$w_buff0_used~0_In817479783, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In817479783, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out817479783|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817479783} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:08:12,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1138839504 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1138839504 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1138839504| ~y$r_buff0_thd2~0_In-1138839504) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1138839504| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1138839504, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1138839504} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1138839504, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1138839504, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1138839504|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:08:12,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In1114368751 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1114368751 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1114368751 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1114368751 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1114368751| ~y$r_buff1_thd2~0_In1114368751) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1114368751| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1114368751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1114368751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1114368751, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1114368751, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1114368751|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:12,242 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-11-28 18:08:12,243 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-11-28 18:08:12,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In344923534 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In344923534 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In344923534 |ULTIMATE.start_main_#t~ite40_Out344923534|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out344923534| ~y~0_In344923534) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In344923534, ~y~0=~y~0_In344923534, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In344923534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344923534} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out344923534|, ~y$w_buff1~0=~y$w_buff1~0_In344923534, ~y~0=~y~0_In344923534, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In344923534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344923534} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:08:12,243 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-11-28 18:08:12,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2086063597 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2086063597 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out2086063597| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2086063597 |ULTIMATE.start_main_#t~ite42_Out2086063597|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2086063597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2086063597} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2086063597, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2086063597, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2086063597|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:08:12,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1403330770 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1403330770 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1403330770 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1403330770 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1403330770| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out1403330770| ~y$w_buff1_used~0_In1403330770) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1403330770, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1403330770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1403330770} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1403330770, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1403330770|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1403330770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1403330770} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:08:12,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1275925583 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1275925583 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1275925583 |ULTIMATE.start_main_#t~ite44_Out-1275925583|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1275925583|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275925583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275925583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1275925583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:08:12,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-460841796 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-460841796 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-460841796 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-460841796 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-460841796|)) (and (= ~y$r_buff1_thd0~0_In-460841796 |ULTIMATE.start_main_#t~ite45_Out-460841796|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460841796, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460841796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460841796, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-460841796, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-460841796|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:08:12,245 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-11-28 18:08:12,351 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:08:12,352 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:08:12,353 INFO L168 Benchmark]: Toolchain (without parser) took 25790.35 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 548.4 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -205.3 MB). Peak memory consumption was 343.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:12,354 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:08:12,354 INFO L168 Benchmark]: CACSL2BoogieTranslator took 939.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:12,355 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:08:12,355 INFO L168 Benchmark]: Boogie Preprocessor took 42.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:12,356 INFO L168 Benchmark]: RCFGBuilder took 855.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:12,356 INFO L168 Benchmark]: TraceAbstraction took 23746.78 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 417.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -139.9 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:12,357 INFO L168 Benchmark]: Witness Printer took 124.07 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:12,359 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 939.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 855.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23746.78 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 417.3 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -139.9 MB). Peak memory consumption was 277.4 MB. Max. memory is 11.5 GB. * Witness Printer took 124.07 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 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: 1.6s, 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: 23.4s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3174 SDtfs, 5374 SDslu, 8149 SDs, 0 SdLazy, 6477 SolverSat, 522 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1479 ImplicationChecksByTransitivity, 3.5s 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: 1.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 23692 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 836 NumberOfCodeBlocks, 836 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 763 ConstructedInterpolants, 0 QuantifiedInterpolants, 143598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...