/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:57:00,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:57:00,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:57:00,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:57:00,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:57:00,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:57:00,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:57:00,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:57:00,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:57:00,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:57:00,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:57:00,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:57:00,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:57:00,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:57:00,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:57:00,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:57:00,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:57:00,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:57:00,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:57:00,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:57:00,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:57:00,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:57:00,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:57:00,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:57:00,345 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:57:00,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:57:00,346 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:57:00,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:57:00,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:57:00,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:57:00,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:57:00,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:57:00,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:57:00,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:57:00,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:57:00,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:57:00,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:57:00,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:57:00,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:57:00,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:57:00,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:57:00,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:57:00,388 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:57:00,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:57:00,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:57:00,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:57:00,390 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:57:00,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:57:00,390 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:57:00,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:57:00,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:57:00,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:57:00,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:57:00,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:57:00,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:57:00,391 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:57:00,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:57:00,392 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:57:00,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:57:00,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:57:00,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:57:00,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:57:00,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:57:00,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:57:00,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:57:00,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:57:00,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:57:00,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:57:00,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:57:00,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:57:00,394 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:57:00,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:57:00,731 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:57:00,735 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:57:00,736 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:57:00,737 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:57:00,737 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2019-12-18 17:57:00,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47d87284d/2fa9561cca7540aeac1fc2bb25bd766a/FLAG9185845cb [2019-12-18 17:57:01,370 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:57:01,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2019-12-18 17:57:01,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47d87284d/2fa9561cca7540aeac1fc2bb25bd766a/FLAG9185845cb [2019-12-18 17:57:01,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47d87284d/2fa9561cca7540aeac1fc2bb25bd766a [2019-12-18 17:57:01,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:57:01,637 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:57:01,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:57:01,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:57:01,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:57:01,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:57:01" (1/1) ... [2019-12-18 17:57:01,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13dc0528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:01, skipping insertion in model container [2019-12-18 17:57:01,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:57:01" (1/1) ... [2019-12-18 17:57:01,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:57:01,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:57:02,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:57:02,220 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:57:02,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:57:02,367 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:57:02,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02 WrapperNode [2019-12-18 17:57:02,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:57:02,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:57:02,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:57:02,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:57:02,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02" (1/1) ... [2019-12-18 17:57:02,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02" (1/1) ... [2019-12-18 17:57:02,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:57:02,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:57:02,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:57:02,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:57:02,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02" (1/1) ... [2019-12-18 17:57:02,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02" (1/1) ... [2019-12-18 17:57:02,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02" (1/1) ... [2019-12-18 17:57:02,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02" (1/1) ... [2019-12-18 17:57:02,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02" (1/1) ... [2019-12-18 17:57:02,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02" (1/1) ... [2019-12-18 17:57:02,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02" (1/1) ... [2019-12-18 17:57:02,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:57:02,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:57:02,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:57:02,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:57:02,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02" (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-12-18 17:57:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:57:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:57:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:57:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:57:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:57:02,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:57:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:57:02,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:57:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:57:02,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:57:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 17:57:02,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 17:57:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:57:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:57:02,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:57:02,555 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:57:03,400 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:57:03,400 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:57:03,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:57:03 BoogieIcfgContainer [2019-12-18 17:57:03,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:57:03,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:57:03,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:57:03,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:57:03,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:57:01" (1/3) ... [2019-12-18 17:57:03,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e491c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:57:03, skipping insertion in model container [2019-12-18 17:57:03,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:57:02" (2/3) ... [2019-12-18 17:57:03,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e491c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:57:03, skipping insertion in model container [2019-12-18 17:57:03,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:57:03" (3/3) ... [2019-12-18 17:57:03,412 INFO L109 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2019-12-18 17:57:03,422 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:57:03,423 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:57:03,431 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:57:03,432 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:57:03,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,486 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,486 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,487 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,490 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,490 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,492 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,493 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,506 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,506 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,506 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,507 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,507 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,509 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,509 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,509 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,519 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,519 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,542 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,543 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,545 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,545 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,545 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,546 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,547 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,547 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,547 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,547 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,547 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,555 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,556 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:57:03,572 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 17:57:03,594 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:57:03,595 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:57:03,595 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:57:03,595 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:57:03,595 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:57:03,596 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:57:03,596 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:57:03,596 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:57:03,619 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 206 transitions [2019-12-18 17:57:03,621 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-18 17:57:03,738 INFO L126 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-18 17:57:03,739 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:57:03,760 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 12/171 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:57:03,785 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-18 17:57:03,851 INFO L126 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-18 17:57:03,851 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:57:03,858 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 12/171 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 17:57:03,873 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 17:57:03,875 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:57:09,066 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 17:57:09,367 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 17:57:09,533 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 17:57:09,561 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56276 [2019-12-18 17:57:09,561 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-18 17:57:09,565 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 100 transitions [2019-12-18 17:57:11,872 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32878 states. [2019-12-18 17:57:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 32878 states. [2019-12-18 17:57:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 17:57:11,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:11,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:11,882 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:11,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:11,887 INFO L82 PathProgramCache]: Analyzing trace with hash -667351009, now seen corresponding path program 1 times [2019-12-18 17:57:11,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:11,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286488704] [2019-12-18 17:57:11,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:12,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286488704] [2019-12-18 17:57:12,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:12,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:57:12,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124712766] [2019-12-18 17:57:12,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:57:12,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:12,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:57:12,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:57:12,207 INFO L87 Difference]: Start difference. First operand 32878 states. Second operand 3 states. [2019-12-18 17:57:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:13,488 INFO L93 Difference]: Finished difference Result 32686 states and 139960 transitions. [2019-12-18 17:57:13,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:57:13,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 17:57:13,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:13,761 INFO L225 Difference]: With dead ends: 32686 [2019-12-18 17:57:13,761 INFO L226 Difference]: Without dead ends: 32062 [2019-12-18 17:57:13,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:57:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32062 states. [2019-12-18 17:57:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32062 to 32062. [2019-12-18 17:57:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32062 states. [2019-12-18 17:57:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32062 states to 32062 states and 137412 transitions. [2019-12-18 17:57:15,707 INFO L78 Accepts]: Start accepts. Automaton has 32062 states and 137412 transitions. Word has length 9 [2019-12-18 17:57:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:15,708 INFO L462 AbstractCegarLoop]: Abstraction has 32062 states and 137412 transitions. [2019-12-18 17:57:15,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:57:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 32062 states and 137412 transitions. [2019-12-18 17:57:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:57:15,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:15,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:15,724 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:15,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:15,724 INFO L82 PathProgramCache]: Analyzing trace with hash -139405083, now seen corresponding path program 1 times [2019-12-18 17:57:15,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:15,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103856630] [2019-12-18 17:57:15,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:15,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103856630] [2019-12-18 17:57:15,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:15,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:57:15,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99631493] [2019-12-18 17:57:15,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:57:15,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:15,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:57:15,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:57:15,880 INFO L87 Difference]: Start difference. First operand 32062 states and 137412 transitions. Second operand 4 states. [2019-12-18 17:57:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:18,332 INFO L93 Difference]: Finished difference Result 51166 states and 211740 transitions. [2019-12-18 17:57:18,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:57:18,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 17:57:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:18,631 INFO L225 Difference]: With dead ends: 51166 [2019-12-18 17:57:18,631 INFO L226 Difference]: Without dead ends: 51138 [2019-12-18 17:57:18,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:57:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51138 states. [2019-12-18 17:57:20,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51138 to 46670. [2019-12-18 17:57:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46670 states. [2019-12-18 17:57:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46670 states to 46670 states and 195108 transitions. [2019-12-18 17:57:20,785 INFO L78 Accepts]: Start accepts. Automaton has 46670 states and 195108 transitions. Word has length 15 [2019-12-18 17:57:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:20,786 INFO L462 AbstractCegarLoop]: Abstraction has 46670 states and 195108 transitions. [2019-12-18 17:57:20,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:57:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 46670 states and 195108 transitions. [2019-12-18 17:57:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 17:57:20,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:20,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:20,789 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:20,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:20,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2113277815, now seen corresponding path program 1 times [2019-12-18 17:57:20,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:20,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817005302] [2019-12-18 17:57:20,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:20,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817005302] [2019-12-18 17:57:20,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:20,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:57:20,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855319664] [2019-12-18 17:57:20,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:57:20,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:20,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:57:20,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:57:20,848 INFO L87 Difference]: Start difference. First operand 46670 states and 195108 transitions. Second operand 3 states. [2019-12-18 17:57:21,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:21,013 INFO L93 Difference]: Finished difference Result 36669 states and 141744 transitions. [2019-12-18 17:57:21,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:57:21,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 17:57:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:21,125 INFO L225 Difference]: With dead ends: 36669 [2019-12-18 17:57:21,126 INFO L226 Difference]: Without dead ends: 36669 [2019-12-18 17:57:21,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:57:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36669 states. [2019-12-18 17:57:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36669 to 36669. [2019-12-18 17:57:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36669 states. [2019-12-18 17:57:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36669 states to 36669 states and 141744 transitions. [2019-12-18 17:57:23,942 INFO L78 Accepts]: Start accepts. Automaton has 36669 states and 141744 transitions. Word has length 15 [2019-12-18 17:57:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:23,942 INFO L462 AbstractCegarLoop]: Abstraction has 36669 states and 141744 transitions. [2019-12-18 17:57:23,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:57:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 36669 states and 141744 transitions. [2019-12-18 17:57:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:57:23,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:23,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:23,945 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:23,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:23,946 INFO L82 PathProgramCache]: Analyzing trace with hash -456655226, now seen corresponding path program 1 times [2019-12-18 17:57:23,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:23,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352033648] [2019-12-18 17:57:23,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:24,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352033648] [2019-12-18 17:57:24,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:24,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:57:24,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632618244] [2019-12-18 17:57:24,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:57:24,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:24,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:57:24,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:57:24,006 INFO L87 Difference]: Start difference. First operand 36669 states and 141744 transitions. Second operand 4 states. [2019-12-18 17:57:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:24,072 INFO L93 Difference]: Finished difference Result 15339 states and 49236 transitions. [2019-12-18 17:57:24,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:57:24,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:57:24,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:24,095 INFO L225 Difference]: With dead ends: 15339 [2019-12-18 17:57:24,095 INFO L226 Difference]: Without dead ends: 15339 [2019-12-18 17:57:24,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:57:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15339 states. [2019-12-18 17:57:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15339 to 15339. [2019-12-18 17:57:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15339 states. [2019-12-18 17:57:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 49236 transitions. [2019-12-18 17:57:24,625 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 49236 transitions. Word has length 16 [2019-12-18 17:57:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:24,625 INFO L462 AbstractCegarLoop]: Abstraction has 15339 states and 49236 transitions. [2019-12-18 17:57:24,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:57:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 49236 transitions. [2019-12-18 17:57:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 17:57:24,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:24,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:24,628 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:24,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1764835742, now seen corresponding path program 1 times [2019-12-18 17:57:24,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:24,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100229427] [2019-12-18 17:57:24,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:24,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:24,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100229427] [2019-12-18 17:57:24,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:24,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:57:24,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925389122] [2019-12-18 17:57:24,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:57:24,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:24,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:57:24,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:57:24,698 INFO L87 Difference]: Start difference. First operand 15339 states and 49236 transitions. Second operand 5 states. [2019-12-18 17:57:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:24,746 INFO L93 Difference]: Finished difference Result 2638 states and 6819 transitions. [2019-12-18 17:57:24,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:57:24,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 17:57:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:24,751 INFO L225 Difference]: With dead ends: 2638 [2019-12-18 17:57:24,751 INFO L226 Difference]: Without dead ends: 2638 [2019-12-18 17:57:24,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:57:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2019-12-18 17:57:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2638. [2019-12-18 17:57:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2019-12-18 17:57:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 6819 transitions. [2019-12-18 17:57:24,790 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 6819 transitions. Word has length 17 [2019-12-18 17:57:24,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:24,790 INFO L462 AbstractCegarLoop]: Abstraction has 2638 states and 6819 transitions. [2019-12-18 17:57:24,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:57:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 6819 transitions. [2019-12-18 17:57:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 17:57:24,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:24,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:24,795 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:24,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:24,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1144833891, now seen corresponding path program 1 times [2019-12-18 17:57:24,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:24,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241534059] [2019-12-18 17:57:24,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:24,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241534059] [2019-12-18 17:57:24,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:24,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:57:24,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433064525] [2019-12-18 17:57:24,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:57:24,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:24,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:57:24,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:57:24,872 INFO L87 Difference]: Start difference. First operand 2638 states and 6819 transitions. Second operand 6 states. [2019-12-18 17:57:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:24,922 INFO L93 Difference]: Finished difference Result 1222 states and 3487 transitions. [2019-12-18 17:57:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:57:24,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 17:57:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:24,924 INFO L225 Difference]: With dead ends: 1222 [2019-12-18 17:57:24,925 INFO L226 Difference]: Without dead ends: 1222 [2019-12-18 17:57:24,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:57:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-18 17:57:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1110. [2019-12-18 17:57:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2019-12-18 17:57:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3167 transitions. [2019-12-18 17:57:24,943 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3167 transitions. Word has length 29 [2019-12-18 17:57:24,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:24,944 INFO L462 AbstractCegarLoop]: Abstraction has 1110 states and 3167 transitions. [2019-12-18 17:57:24,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:57:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3167 transitions. [2019-12-18 17:57:24,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:57:24,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:24,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:24,948 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:24,949 INFO L82 PathProgramCache]: Analyzing trace with hash -275883304, now seen corresponding path program 1 times [2019-12-18 17:57:24,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:24,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484218561] [2019-12-18 17:57:24,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:25,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484218561] [2019-12-18 17:57:25,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:25,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:57:25,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71727817] [2019-12-18 17:57:25,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:57:25,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:25,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:57:25,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:57:25,049 INFO L87 Difference]: Start difference. First operand 1110 states and 3167 transitions. Second operand 3 states. [2019-12-18 17:57:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:25,109 INFO L93 Difference]: Finished difference Result 1120 states and 3182 transitions. [2019-12-18 17:57:25,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:57:25,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 17:57:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:25,111 INFO L225 Difference]: With dead ends: 1120 [2019-12-18 17:57:25,111 INFO L226 Difference]: Without dead ends: 1120 [2019-12-18 17:57:25,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:57:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-18 17:57:25,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1114. [2019-12-18 17:57:25,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-12-18 17:57:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 3175 transitions. [2019-12-18 17:57:25,128 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 3175 transitions. Word has length 58 [2019-12-18 17:57:25,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:25,129 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 3175 transitions. [2019-12-18 17:57:25,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:57:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 3175 transitions. [2019-12-18 17:57:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:57:25,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:25,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:25,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:25,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:25,133 INFO L82 PathProgramCache]: Analyzing trace with hash -791070951, now seen corresponding path program 1 times [2019-12-18 17:57:25,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:25,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146172978] [2019-12-18 17:57:25,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:25,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146172978] [2019-12-18 17:57:25,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:25,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:57:25,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504063996] [2019-12-18 17:57:25,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:57:25,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:25,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:57:25,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:57:25,284 INFO L87 Difference]: Start difference. First operand 1114 states and 3175 transitions. Second operand 5 states. [2019-12-18 17:57:25,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:25,550 INFO L93 Difference]: Finished difference Result 1623 states and 4613 transitions. [2019-12-18 17:57:25,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:57:25,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 17:57:25,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:25,554 INFO L225 Difference]: With dead ends: 1623 [2019-12-18 17:57:25,554 INFO L226 Difference]: Without dead ends: 1623 [2019-12-18 17:57:25,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:57:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2019-12-18 17:57:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1210. [2019-12-18 17:57:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-12-18 17:57:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3463 transitions. [2019-12-18 17:57:25,577 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3463 transitions. Word has length 58 [2019-12-18 17:57:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:25,577 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 3463 transitions. [2019-12-18 17:57:25,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:57:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3463 transitions. [2019-12-18 17:57:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:57:25,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:25,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:25,583 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:25,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:25,583 INFO L82 PathProgramCache]: Analyzing trace with hash 867176459, now seen corresponding path program 2 times [2019-12-18 17:57:25,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:25,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032556144] [2019-12-18 17:57:25,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:25,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032556144] [2019-12-18 17:57:25,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:25,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:57:25,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045678322] [2019-12-18 17:57:25,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:57:25,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:25,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:57:25,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:57:25,756 INFO L87 Difference]: Start difference. First operand 1210 states and 3463 transitions. Second operand 6 states. [2019-12-18 17:57:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:26,125 INFO L93 Difference]: Finished difference Result 1488 states and 4124 transitions. [2019-12-18 17:57:26,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:57:26,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:57:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:26,129 INFO L225 Difference]: With dead ends: 1488 [2019-12-18 17:57:26,129 INFO L226 Difference]: Without dead ends: 1488 [2019-12-18 17:57:26,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:57:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-18 17:57:26,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1266. [2019-12-18 17:57:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-12-18 17:57:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 3555 transitions. [2019-12-18 17:57:26,149 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 3555 transitions. Word has length 58 [2019-12-18 17:57:26,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:26,150 INFO L462 AbstractCegarLoop]: Abstraction has 1266 states and 3555 transitions. [2019-12-18 17:57:26,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:57:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 3555 transitions. [2019-12-18 17:57:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:57:26,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:26,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:26,154 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:26,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2105802411, now seen corresponding path program 3 times [2019-12-18 17:57:26,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:26,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512769536] [2019-12-18 17:57:26,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:26,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512769536] [2019-12-18 17:57:26,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:26,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:57:26,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054636657] [2019-12-18 17:57:26,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:57:26,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:26,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:57:26,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:57:26,255 INFO L87 Difference]: Start difference. First operand 1266 states and 3555 transitions. Second operand 6 states. [2019-12-18 17:57:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:26,527 INFO L93 Difference]: Finished difference Result 1768 states and 4927 transitions. [2019-12-18 17:57:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:57:26,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 17:57:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:26,537 INFO L225 Difference]: With dead ends: 1768 [2019-12-18 17:57:26,538 INFO L226 Difference]: Without dead ends: 1768 [2019-12-18 17:57:26,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:57:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2019-12-18 17:57:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1294. [2019-12-18 17:57:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-12-18 17:57:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 3635 transitions. [2019-12-18 17:57:26,560 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 3635 transitions. Word has length 58 [2019-12-18 17:57:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:26,561 INFO L462 AbstractCegarLoop]: Abstraction has 1294 states and 3635 transitions. [2019-12-18 17:57:26,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:57:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 3635 transitions. [2019-12-18 17:57:26,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 17:57:26,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:26,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:26,565 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:26,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:26,565 INFO L82 PathProgramCache]: Analyzing trace with hash -645544041, now seen corresponding path program 4 times [2019-12-18 17:57:26,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:26,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302862475] [2019-12-18 17:57:26,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:26,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302862475] [2019-12-18 17:57:26,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:26,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:57:26,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935078626] [2019-12-18 17:57:26,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:57:26,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:26,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:57:26,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:57:26,671 INFO L87 Difference]: Start difference. First operand 1294 states and 3635 transitions. Second operand 7 states. [2019-12-18 17:57:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:27,577 INFO L93 Difference]: Finished difference Result 2005 states and 5574 transitions. [2019-12-18 17:57:27,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:57:27,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-18 17:57:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:27,581 INFO L225 Difference]: With dead ends: 2005 [2019-12-18 17:57:27,581 INFO L226 Difference]: Without dead ends: 2005 [2019-12-18 17:57:27,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:57:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2019-12-18 17:57:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1294. [2019-12-18 17:57:27,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-12-18 17:57:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 3635 transitions. [2019-12-18 17:57:27,605 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 3635 transitions. Word has length 58 [2019-12-18 17:57:27,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:27,606 INFO L462 AbstractCegarLoop]: Abstraction has 1294 states and 3635 transitions. [2019-12-18 17:57:27,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:57:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 3635 transitions. [2019-12-18 17:57:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:57:27,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:27,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:27,610 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:27,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:27,610 INFO L82 PathProgramCache]: Analyzing trace with hash -515953626, now seen corresponding path program 1 times [2019-12-18 17:57:27,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:27,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866014873] [2019-12-18 17:57:27,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:27,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866014873] [2019-12-18 17:57:27,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:27,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:57:27,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181569774] [2019-12-18 17:57:27,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:57:27,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:27,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:57:27,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:57:27,707 INFO L87 Difference]: Start difference. First operand 1294 states and 3635 transitions. Second operand 3 states. [2019-12-18 17:57:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:27,753 INFO L93 Difference]: Finished difference Result 1293 states and 3633 transitions. [2019-12-18 17:57:27,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:57:27,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:57:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:27,755 INFO L225 Difference]: With dead ends: 1293 [2019-12-18 17:57:27,756 INFO L226 Difference]: Without dead ends: 1293 [2019-12-18 17:57:27,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:57:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-12-18 17:57:27,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 952. [2019-12-18 17:57:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-18 17:57:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2683 transitions. [2019-12-18 17:57:27,774 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2683 transitions. Word has length 59 [2019-12-18 17:57:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:27,774 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 2683 transitions. [2019-12-18 17:57:27,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:57:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2683 transitions. [2019-12-18 17:57:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 17:57:27,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:27,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:27,778 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:27,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:27,778 INFO L82 PathProgramCache]: Analyzing trace with hash 654382096, now seen corresponding path program 1 times [2019-12-18 17:57:27,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:27,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870891769] [2019-12-18 17:57:27,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:27,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870891769] [2019-12-18 17:57:27,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:27,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:57:27,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216853695] [2019-12-18 17:57:27,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:57:27,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:27,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:57:27,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:57:27,856 INFO L87 Difference]: Start difference. First operand 952 states and 2683 transitions. Second operand 3 states. [2019-12-18 17:57:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:27,873 INFO L93 Difference]: Finished difference Result 936 states and 2615 transitions. [2019-12-18 17:57:27,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:57:27,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 17:57:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:27,876 INFO L225 Difference]: With dead ends: 936 [2019-12-18 17:57:27,876 INFO L226 Difference]: Without dead ends: 936 [2019-12-18 17:57:27,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:57:27,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-12-18 17:57:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2019-12-18 17:57:27,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2019-12-18 17:57:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 2615 transitions. [2019-12-18 17:57:27,890 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 2615 transitions. Word has length 59 [2019-12-18 17:57:27,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:27,891 INFO L462 AbstractCegarLoop]: Abstraction has 936 states and 2615 transitions. [2019-12-18 17:57:27,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:57:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 2615 transitions. [2019-12-18 17:57:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:57:27,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:27,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:27,894 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:27,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:27,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1664209591, now seen corresponding path program 1 times [2019-12-18 17:57:27,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:27,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969327202] [2019-12-18 17:57:27,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:28,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969327202] [2019-12-18 17:57:28,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:28,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 17:57:28,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420348752] [2019-12-18 17:57:28,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 17:57:28,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:28,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 17:57:28,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:57:28,211 INFO L87 Difference]: Start difference. First operand 936 states and 2615 transitions. Second operand 12 states. [2019-12-18 17:57:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:29,520 INFO L93 Difference]: Finished difference Result 2706 states and 7172 transitions. [2019-12-18 17:57:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 17:57:29,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 17:57:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:29,524 INFO L225 Difference]: With dead ends: 2706 [2019-12-18 17:57:29,524 INFO L226 Difference]: Without dead ends: 1730 [2019-12-18 17:57:29,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=1065, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 17:57:29,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2019-12-18 17:57:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 796. [2019-12-18 17:57:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-12-18 17:57:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2144 transitions. [2019-12-18 17:57:29,539 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2144 transitions. Word has length 60 [2019-12-18 17:57:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:29,539 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 2144 transitions. [2019-12-18 17:57:29,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 17:57:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2144 transitions. [2019-12-18 17:57:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:57:29,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:29,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:29,541 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:29,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:29,541 INFO L82 PathProgramCache]: Analyzing trace with hash -92263015, now seen corresponding path program 2 times [2019-12-18 17:57:29,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:29,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123670848] [2019-12-18 17:57:29,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:29,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:29,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123670848] [2019-12-18 17:57:29,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:29,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:57:29,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971515418] [2019-12-18 17:57:29,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:57:29,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:29,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:57:29,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:57:29,670 INFO L87 Difference]: Start difference. First operand 796 states and 2144 transitions. Second operand 6 states. [2019-12-18 17:57:29,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:29,757 INFO L93 Difference]: Finished difference Result 1358 states and 3386 transitions. [2019-12-18 17:57:29,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:57:29,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 17:57:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:29,759 INFO L225 Difference]: With dead ends: 1358 [2019-12-18 17:57:29,759 INFO L226 Difference]: Without dead ends: 737 [2019-12-18 17:57:29,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:57:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-18 17:57:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 575. [2019-12-18 17:57:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-18 17:57:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1356 transitions. [2019-12-18 17:57:29,770 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1356 transitions. Word has length 60 [2019-12-18 17:57:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:29,770 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1356 transitions. [2019-12-18 17:57:29,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:57:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1356 transitions. [2019-12-18 17:57:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:57:29,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:29,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:29,773 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:29,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1752143333, now seen corresponding path program 3 times [2019-12-18 17:57:29,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:29,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510578882] [2019-12-18 17:57:29,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:57:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:57:29,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510578882] [2019-12-18 17:57:29,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:57:29,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:57:29,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417378661] [2019-12-18 17:57:29,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:57:29,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:57:29,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:57:29,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:57:29,915 INFO L87 Difference]: Start difference. First operand 575 states and 1356 transitions. Second operand 6 states. [2019-12-18 17:57:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:57:29,988 INFO L93 Difference]: Finished difference Result 930 states and 2158 transitions. [2019-12-18 17:57:29,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:57:29,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 17:57:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:57:29,990 INFO L225 Difference]: With dead ends: 930 [2019-12-18 17:57:29,990 INFO L226 Difference]: Without dead ends: 245 [2019-12-18 17:57:29,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:57:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-12-18 17:57:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 213. [2019-12-18 17:57:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-18 17:57:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 368 transitions. [2019-12-18 17:57:29,993 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 368 transitions. Word has length 60 [2019-12-18 17:57:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:57:29,993 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 368 transitions. [2019-12-18 17:57:29,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:57:29,994 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 368 transitions. [2019-12-18 17:57:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 17:57:29,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:57:29,995 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:57:29,995 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:57:29,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:57:29,995 INFO L82 PathProgramCache]: Analyzing trace with hash -524819563, now seen corresponding path program 4 times [2019-12-18 17:57:29,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:57:29,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266052942] [2019-12-18 17:57:29,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:57:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:57:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:57:30,140 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:57:30,141 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:57:30,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~weak$$choice2~0_146 0) (= v_~z$w_buff0_used~0_885 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$r_buff1_thd0~0_298 0) (= 0 v_~z$r_buff1_thd2~0_83) (= 0 v_~z$r_buff1_thd4~0_140) (= 0 v_~z$r_buff1_thd1~0_83) (= 0 v_~z$flush_delayed~0_36) (= v_~z$r_buff0_thd3~0_92 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1525~0.base_24| 1)) (= v_~z$read_delayed_var~0.offset_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1525~0.base_24|) 0) (= 0 |v_ULTIMATE.start_main_~#t1525~0.offset_18|) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p3_EAX~0_100 0) (= v_~z$w_buff0~0_503 0) (= v_~z$w_buff1_used~0_515 0) (= v_~a~0_48 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1525~0.base_24|) (= v_~x~0_57 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z~0_155 0) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= v_~__unbuffered_cnt~0_141 0) (= 0 v_~z$r_buff1_thd3~0_146) (= v_~z$w_buff1~0_306 0) (= v_~z$r_buff0_thd0~0_394 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff0_thd2~0_32 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1525~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1525~0.base_24|) |v_ULTIMATE.start_main_~#t1525~0.offset_18| 0)) |v_#memory_int_25|) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd4~0_161) (= v_~y~0_76 0) (= v_~z$r_buff0_thd1~0_32 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1525~0.base_24| 4)) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_59|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_83, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_41|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_32|, ULTIMATE.start_main_~#t1527~0.offset=|v_ULTIMATE.start_main_~#t1527~0.offset_16|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_35|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_30|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_45|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_394, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_161, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_100, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_48|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_114|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_515, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_191|, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ULTIMATE.start_main_~#t1525~0.offset=|v_ULTIMATE.start_main_~#t1525~0.offset_18|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_35|, ULTIMATE.start_main_~#t1526~0.base=|v_ULTIMATE.start_main_~#t1526~0.base_22|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ULTIMATE.start_main_~#t1525~0.base=|v_ULTIMATE.start_main_~#t1525~0.base_24|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_38|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_92, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_57, ULTIMATE.start_main_~#t1526~0.offset=|v_ULTIMATE.start_main_~#t1526~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_140, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~z$w_buff1~0=v_~z$w_buff1~0_306, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_29|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_51|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_298, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_25|, ULTIMATE.start_main_~#t1527~0.base=|v_ULTIMATE.start_main_~#t1527~0.base_20|, ULTIMATE.start_main_~#t1528~0.offset=|v_ULTIMATE.start_main_~#t1528~0.offset_17|, ~y~0=v_~y~0_76, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_885, ~z$w_buff0~0=v_~z$w_buff0~0_503, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_39|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_146, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_122|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_36|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ULTIMATE.start_main_~#t1528~0.base=|v_ULTIMATE.start_main_~#t1528~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_23|, ~z~0=v_~z~0_155, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1527~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1525~0.offset, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1526~0.base, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1525~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1526~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1527~0.base, ULTIMATE.start_main_~#t1528~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1528~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:57:30,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L821-1-->L823: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1526~0.offset_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1526~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1526~0.base_10|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1526~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1526~0.base_10|) |v_ULTIMATE.start_main_~#t1526~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1526~0.base_10| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1526~0.base_10|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1526~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1526~0.base=|v_ULTIMATE.start_main_~#t1526~0.base_10|, ULTIMATE.start_main_~#t1526~0.offset=|v_ULTIMATE.start_main_~#t1526~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1526~0.base, ULTIMATE.start_main_~#t1526~0.offset] because there is no mapped edge [2019-12-18 17:57:30,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L823-1-->L825: Formula: (and (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t1527~0.base_12| 1)) (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t1527~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1527~0.base_12| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1527~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1527~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1527~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1527~0.base_12|) |v_ULTIMATE.start_main_~#t1527~0.offset_10| 2)) |v_#memory_int_17|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1527~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1527~0.offset=|v_ULTIMATE.start_main_~#t1527~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1527~0.base=|v_ULTIMATE.start_main_~#t1527~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1527~0.offset, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1527~0.base, #length] because there is no mapped edge [2019-12-18 17:57:30,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L825-1-->L827: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1528~0.base_11| 4) |v_#length_19|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1528~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1528~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1528~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1528~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1528~0.base_11|) |v_ULTIMATE.start_main_~#t1528~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1528~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1528~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1528~0.base=|v_ULTIMATE.start_main_~#t1528~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ULTIMATE.start_main_~#t1528~0.offset=|v_ULTIMATE.start_main_~#t1528~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1528~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1528~0.offset] because there is no mapped edge [2019-12-18 17:57:30,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11| 1) (= v_P3Thread1of1ForFork2_~arg.offset_11 |v_P3Thread1of1ForFork2_#in~arg.offset_11|) (= (mod v_~z$w_buff1_used~0_99 256) 0) (= |v_P3Thread1of1ForFork2_#in~arg.base_11| v_P3Thread1of1ForFork2_~arg.base_11) (= v_~z$w_buff0_used~0_218 1) (= v_~z$w_buff0~0_48 v_~z$w_buff1~0_32) (= 2 v_~z$w_buff0~0_47) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|) (= v_~z$w_buff0_used~0_219 v_~z$w_buff1_used~0_99)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_219, ~z$w_buff0~0=v_~z$w_buff0~0_48, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_11, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_218, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_99, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, ~z$w_buff1~0=v_~z$w_buff1~0_32, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_11, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 17:57:30,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_19 |v_P0Thread1of1ForFork3_#in~arg.base_19|) (= v_~x~0_44 1) (= 0 |v_P0Thread1of1ForFork3_#res.base_11|) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_19| v_P0Thread1of1ForFork3_~arg.offset_19) (= 0 |v_P0Thread1of1ForFork3_#res.offset_11|) (= v_~a~0_40 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|} OutVars{~a~0=v_~a~0_40, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_19, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_11|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_19, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|, ~x~0=v_~x~0_44} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-18 17:57:30,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_39 2) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_~y~0_50 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_10| v_P1Thread1of1ForFork0_~arg.offset_10) (= v_P1Thread1of1ForFork0_~arg.base_10 |v_P1Thread1of1ForFork0_#in~arg.base_10|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_10, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_10, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_50, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 17:57:30,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L768-2-->L768-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork1_#t~ite4_Out-935002756| |P2Thread1of1ForFork1_#t~ite3_Out-935002756|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-935002756 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-935002756 256) 0))) (or (and (not .cse0) .cse1 (= ~z$w_buff1~0_In-935002756 |P2Thread1of1ForFork1_#t~ite3_Out-935002756|) (not .cse2)) (and (= |P2Thread1of1ForFork1_#t~ite3_Out-935002756| ~z~0_In-935002756) .cse1 (or .cse0 .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-935002756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-935002756, ~z$w_buff1~0=~z$w_buff1~0_In-935002756, ~z~0=~z~0_In-935002756} OutVars{P2Thread1of1ForFork1_#t~ite4=|P2Thread1of1ForFork1_#t~ite4_Out-935002756|, P2Thread1of1ForFork1_#t~ite3=|P2Thread1of1ForFork1_#t~ite3_Out-935002756|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-935002756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-935002756, ~z$w_buff1~0=~z$w_buff1~0_In-935002756, ~z~0=~z~0_In-935002756} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite4, P2Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-18 17:57:30,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2144010488 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In2144010488 256) 0))) (or (and (= ~z$w_buff0_used~0_In2144010488 |P2Thread1of1ForFork1_#t~ite5_Out2144010488|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite5_Out2144010488|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2144010488, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2144010488} OutVars{P2Thread1of1ForFork1_#t~ite5=|P2Thread1of1ForFork1_#t~ite5_Out2144010488|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2144010488, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2144010488} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 17:57:30,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In1809025617 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1809025617 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1809025617 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1809025617 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite6_Out1809025617|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1809025617 |P2Thread1of1ForFork1_#t~ite6_Out1809025617|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1809025617, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1809025617, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1809025617, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1809025617} OutVars{P2Thread1of1ForFork1_#t~ite6=|P2Thread1of1ForFork1_#t~ite6_Out1809025617|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1809025617, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1809025617, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1809025617, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1809025617} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 17:57:30,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-324154035 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-324154035 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite7_Out-324154035| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite7_Out-324154035| ~z$r_buff0_thd3~0_In-324154035)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-324154035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-324154035} OutVars{P2Thread1of1ForFork1_#t~ite7=|P2Thread1of1ForFork1_#t~ite7_Out-324154035|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-324154035, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-324154035} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-18 17:57:30,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L772-->L772-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In726300165 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In726300165 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In726300165 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In726300165 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite8_Out726300165|)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite8_Out726300165| ~z$r_buff1_thd3~0_In726300165) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In726300165, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In726300165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In726300165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In726300165} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In726300165, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In726300165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In726300165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In726300165, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out726300165|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:57:30,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L772-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~z$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork1_#t~ite8_46|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_46|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_45|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:57:30,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-609048107 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-609048107 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite11_Out-609048107| 0) (not .cse1)) (and (= |P3Thread1of1ForFork2_#t~ite11_Out-609048107| ~z$w_buff0_used~0_In-609048107) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-609048107, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-609048107} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-609048107, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-609048107, P3Thread1of1ForFork2_#t~ite11=|P3Thread1of1ForFork2_#t~ite11_Out-609048107|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 17:57:30,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In572672811 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In572672811 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In572672811 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In572672811 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite12_Out572672811| ~z$w_buff1_used~0_In572672811) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork2_#t~ite12_Out572672811| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In572672811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In572672811, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In572672811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In572672811} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In572672811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In572672811, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In572672811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In572672811, P3Thread1of1ForFork2_#t~ite12=|P3Thread1of1ForFork2_#t~ite12_Out572672811|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 17:57:30,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L801-->L802: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1161123068 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1161123068 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1161123068) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out1161123068 ~z$r_buff0_thd4~0_In1161123068)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1161123068, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1161123068} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1161123068, P3Thread1of1ForFork2_#t~ite13=|P3Thread1of1ForFork2_#t~ite13_Out1161123068|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1161123068} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite13, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 17:57:30,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1262197760 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1262197760 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In1262197760 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1262197760 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite14_Out1262197760|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork2_#t~ite14_Out1262197760| ~z$r_buff1_thd4~0_In1262197760) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1262197760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1262197760, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1262197760, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1262197760} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1262197760, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1262197760, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1262197760, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1262197760, P3Thread1of1ForFork2_#t~ite14=|P3Thread1of1ForFork2_#t~ite14_Out1262197760|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 17:57:30,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L802-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite14_56| v_~z$r_buff1_thd4~0_130) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_130, P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_55|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite14, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 17:57:30,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L827-1-->L833: Formula: (and (= 4 v_~__unbuffered_cnt~0_21) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-18 17:57:30,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L833-2-->L833-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1225685227 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1225685227 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1225685227 |ULTIMATE.start_main_#t~ite19_Out1225685227|)) (and (not .cse1) (= ~z$w_buff1~0_In1225685227 |ULTIMATE.start_main_#t~ite19_Out1225685227|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1225685227, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1225685227, ~z$w_buff1~0=~z$w_buff1~0_In1225685227, ~z~0=~z~0_In1225685227} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1225685227|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1225685227, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1225685227, ~z$w_buff1~0=~z$w_buff1~0_In1225685227, ~z~0=~z~0_In1225685227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 17:57:30,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L833-4-->L834: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite19_8|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|, ~z~0=v_~z~0_31, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 17:57:30,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In311408884 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In311408884 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out311408884| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out311408884| ~z$w_buff0_used~0_In311408884)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In311408884, ~z$w_buff0_used~0=~z$w_buff0_used~0_In311408884} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In311408884, ~z$w_buff0_used~0=~z$w_buff0_used~0_In311408884, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out311408884|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 17:57:30,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L835-->L835-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1326593827 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1326593827 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1326593827 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1326593827 256)))) (or (and (= ~z$w_buff1_used~0_In1326593827 |ULTIMATE.start_main_#t~ite22_Out1326593827|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1326593827|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1326593827, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1326593827, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1326593827, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1326593827} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1326593827, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1326593827, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1326593827, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1326593827, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1326593827|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 17:57:30,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-808028351 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-808028351 256)))) (or (and (= ~z$r_buff0_thd0~0_In-808028351 |ULTIMATE.start_main_#t~ite23_Out-808028351|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out-808028351|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-808028351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-808028351} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-808028351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-808028351, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-808028351|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 17:57:30,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2072827565 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2072827565 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2072827565 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-2072827565 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-2072827565| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-2072827565 |ULTIMATE.start_main_#t~ite24_Out-2072827565|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2072827565, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2072827565, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2072827565, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2072827565} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2072827565, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2072827565, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2072827565, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-2072827565|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2072827565} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 17:57:30,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L849-->L850: Formula: (and (= v_~z$r_buff0_thd0~0_119 v_~z$r_buff0_thd0~0_120) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:57:30,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L850-->L850-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-264951267 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-264951267| ~z$r_buff1_thd0~0_In-264951267) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In-264951267| |ULTIMATE.start_main_#t~ite45_Out-264951267|)) (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-264951267 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-264951267 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-264951267 256))) (and (= 0 (mod ~z$r_buff1_thd0~0_In-264951267 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out-264951267| ~z$r_buff1_thd0~0_In-264951267) (= |ULTIMATE.start_main_#t~ite45_Out-264951267| |ULTIMATE.start_main_#t~ite46_Out-264951267|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-264951267, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-264951267, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-264951267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-264951267, ~weak$$choice2~0=~weak$$choice2~0_In-264951267, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-264951267|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-264951267, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-264951267, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-264951267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-264951267, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-264951267|, ~weak$$choice2~0=~weak$$choice2~0_In-264951267, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-264951267|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:57:30,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L852-->L855-1: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_120) (= 0 v_~z$flush_delayed~0_24) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (not (= 0 (mod v_~z$flush_delayed~0_25 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_25} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~z~0=v_~z~0_120, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:57:30,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L855-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 17:57:30,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:57:30 BasicIcfg [2019-12-18 17:57:30,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:57:30,324 INFO L168 Benchmark]: Toolchain (without parser) took 28686.07 ms. Allocated memory was 137.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 99.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 570.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:57:30,327 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 17:57:30,328 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.87 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 99.2 MB in the beginning and 156.0 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:57:30,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.20 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 152.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 17:57:30,331 INFO L168 Benchmark]: Boogie Preprocessor took 41.66 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 17:57:30,333 INFO L168 Benchmark]: RCFGBuilder took 916.88 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 101.7 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:57:30,334 INFO L168 Benchmark]: TraceAbstraction took 26916.65 ms. Allocated memory was 202.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 101.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 506.5 MB. Max. memory is 7.1 GB. [2019-12-18 17:57:30,346 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.52 ms. Allocated memory is still 137.4 MB. Free memory was 119.3 MB in the beginning and 119.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 729.87 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 99.2 MB in the beginning and 156.0 MB in the end (delta: -56.8 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.20 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 152.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.66 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 916.88 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 101.7 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 26916.65 ms. Allocated memory was 202.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 101.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 506.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 178 ProgramPointsBefore, 91 ProgramPointsAfterwards, 206 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 24 ChoiceCompositions, 4617 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 231 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 56276 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L788] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L789] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L790] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L791] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L792] 4 z$r_buff0_thd4 = (_Bool)1 [L795] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 3 y = 2 [L765] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L769] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L799] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L800] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L837] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L840] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L841] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L842] 0 z$flush_delayed = weak$$choice2 [L843] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L845] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L847] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L848] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 26.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1830 SDtfs, 1872 SDslu, 3941 SDs, 0 SdLazy, 2213 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46670occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 7875 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 673 ConstructedInterpolants, 0 QuantifiedInterpolants, 111349 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...