/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:40:36,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:40:36,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:40:36,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:40:36,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:40:36,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:40:36,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:40:36,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:40:36,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:40:36,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:40:36,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:40:36,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:40:36,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:40:36,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:40:36,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:40:36,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:40:36,358 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:40:36,359 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:40:36,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:40:36,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:40:36,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:40:36,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:40:36,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:40:36,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:40:36,370 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:40:36,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:40:36,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:40:36,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:40:36,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:40:36,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:40:36,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:40:36,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:40:36,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:40:36,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:40:36,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:40:36,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:40:36,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:40:36,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:40:36,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:40:36,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:40:36,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:40:36,380 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-VariableLbe-MCR.epf [2019-12-27 21:40:36,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:40:36,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:40:36,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:40:36,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:40:36,400 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:40:36,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:40:36,401 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:40:36,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:40:36,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:40:36,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:40:36,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:40:36,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:40:36,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:40:36,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:40:36,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:40:36,403 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:40:36,403 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:40:36,403 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:40:36,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:40:36,403 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:40:36,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:40:36,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:40:36,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:40:36,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:40:36,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:40:36,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:40:36,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:40:36,406 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:40:36,407 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:40:36,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:40:36,408 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:40:36,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:40:36,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:40:36,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:40:36,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:40:36,726 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:40:36,727 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:40:36,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2019-12-27 21:40:36,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f755f75/260e48052806439f87adca2e55c2b5d0/FLAG7db5a4763 [2019-12-27 21:40:37,454 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:40:37,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2019-12-27 21:40:37,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f755f75/260e48052806439f87adca2e55c2b5d0/FLAG7db5a4763 [2019-12-27 21:40:37,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f755f75/260e48052806439f87adca2e55c2b5d0 [2019-12-27 21:40:37,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:40:37,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:40:37,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:40:37,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:40:37,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:40:37,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:40:37" (1/1) ... [2019-12-27 21:40:37,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f84663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:37, skipping insertion in model container [2019-12-27 21:40:37,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:40:37" (1/1) ... [2019-12-27 21:40:37,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:40:37,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:40:38,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:40:38,292 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:40:38,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:40:38,470 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:40:38,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38 WrapperNode [2019-12-27 21:40:38,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:40:38,471 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:40:38,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:40:38,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:40:38,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38" (1/1) ... [2019-12-27 21:40:38,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38" (1/1) ... [2019-12-27 21:40:38,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:40:38,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:40:38,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:40:38,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:40:38,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38" (1/1) ... [2019-12-27 21:40:38,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38" (1/1) ... [2019-12-27 21:40:38,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38" (1/1) ... [2019-12-27 21:40:38,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38" (1/1) ... [2019-12-27 21:40:38,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38" (1/1) ... [2019-12-27 21:40:38,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38" (1/1) ... [2019-12-27 21:40:38,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38" (1/1) ... [2019-12-27 21:40:38,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:40:38,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:40:38,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:40:38,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:40:38,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38" (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-27 21:40:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:40:38,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:40:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:40:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:40:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:40:38,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:40:38,652 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:40:38,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:40:38,653 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:40:38,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:40:38,653 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 21:40:38,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 21:40:38,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:40:38,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:40:38,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:40:38,656 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:40:39,421 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:40:39,421 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:40:39,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:40:39 BoogieIcfgContainer [2019-12-27 21:40:39,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:40:39,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:40:39,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:40:39,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:40:39,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:40:37" (1/3) ... [2019-12-27 21:40:39,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c9a124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:40:39, skipping insertion in model container [2019-12-27 21:40:39,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:40:38" (2/3) ... [2019-12-27 21:40:39,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c9a124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:40:39, skipping insertion in model container [2019-12-27 21:40:39,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:40:39" (3/3) ... [2019-12-27 21:40:39,435 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_pso.opt.i [2019-12-27 21:40:39,443 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:40:39,443 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:40:39,451 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:40:39,452 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:40:39,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,490 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,490 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,491 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,493 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,493 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,494 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,495 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,502 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,502 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,503 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,503 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,503 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,503 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,504 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,504 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,504 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,505 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,506 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,507 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,508 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,509 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,509 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,509 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,509 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,517 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,518 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,522 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,523 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,540 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,540 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,541 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,542 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,543 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,543 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:40:39,558 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 21:40:39,574 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:40:39,574 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:40:39,574 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:40:39,574 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:40:39,574 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:40:39,574 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:40:39,575 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:40:39,575 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:40:39,592 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-27 21:40:39,594 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 21:40:39,690 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 21:40:39,690 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:40:39,704 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:40:39,723 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-27 21:40:39,775 INFO L132 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-27 21:40:39,775 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:40:39,781 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 203 events. 41/203 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 21:40:39,796 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 21:40:39,797 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:40:43,285 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 21:40:43,405 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 21:40:43,424 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51526 [2019-12-27 21:40:43,424 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 21:40:43,427 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 96 transitions [2019-12-27 21:40:45,353 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-27 21:40:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-27 21:40:45,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 21:40:45,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:40:45,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:40:45,364 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:40:45,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:40:45,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1005539762, now seen corresponding path program 1 times [2019-12-27 21:40:45,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:40:45,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623461522] [2019-12-27 21:40:45,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:40:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:40:45,631 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-27 21:40:45,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623461522] [2019-12-27 21:40:45,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:40:45,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:40:45,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [88608247] [2019-12-27 21:40:45,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:40:45,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:40:45,657 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 21:40:45,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:40:45,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:40:45,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:40:45,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:40:45,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:40:45,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:40:45,677 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-27 21:40:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:40:47,277 INFO L93 Difference]: Finished difference Result 34366 states and 145048 transitions. [2019-12-27 21:40:47,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:40:47,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 21:40:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:40:47,674 INFO L225 Difference]: With dead ends: 34366 [2019-12-27 21:40:47,682 INFO L226 Difference]: Without dead ends: 33694 [2019-12-27 21:40:47,686 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-27 21:40:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-27 21:40:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-27 21:40:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-27 21:40:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 142304 transitions. [2019-12-27 21:40:49,647 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 142304 transitions. Word has length 9 [2019-12-27 21:40:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:40:49,648 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 142304 transitions. [2019-12-27 21:40:49,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:40:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 142304 transitions. [2019-12-27 21:40:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:40:49,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:40:49,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:40:49,655 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:40:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:40:49,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1499462081, now seen corresponding path program 1 times [2019-12-27 21:40:49,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:40:49,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854974113] [2019-12-27 21:40:49,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:40:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:40:49,775 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-27 21:40:49,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854974113] [2019-12-27 21:40:49,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:40:49,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:40:49,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [966156563] [2019-12-27 21:40:49,778 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:40:49,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:40:49,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 21:40:49,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:40:49,829 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:40:49,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:40:49,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:40:49,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:40:49,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:40:49,831 INFO L87 Difference]: Start difference. First operand 33694 states and 142304 transitions. Second operand 5 states. [2019-12-27 21:40:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:40:52,436 INFO L93 Difference]: Finished difference Result 52350 states and 214000 transitions. [2019-12-27 21:40:52,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:40:52,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 21:40:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:40:52,745 INFO L225 Difference]: With dead ends: 52350 [2019-12-27 21:40:52,746 INFO L226 Difference]: Without dead ends: 52322 [2019-12-27 21:40:52,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:40:53,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-27 21:40:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 46842. [2019-12-27 21:40:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46842 states. [2019-12-27 21:40:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46842 states to 46842 states and 193636 transitions. [2019-12-27 21:40:54,933 INFO L78 Accepts]: Start accepts. Automaton has 46842 states and 193636 transitions. Word has length 15 [2019-12-27 21:40:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:40:54,934 INFO L462 AbstractCegarLoop]: Abstraction has 46842 states and 193636 transitions. [2019-12-27 21:40:54,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:40:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 46842 states and 193636 transitions. [2019-12-27 21:40:54,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 21:40:54,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:40:54,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:40:54,937 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:40:54,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:40:54,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1997976486, now seen corresponding path program 1 times [2019-12-27 21:40:54,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:40:54,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007156998] [2019-12-27 21:40:54,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:40:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:40:55,059 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-27 21:40:55,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007156998] [2019-12-27 21:40:55,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:40:55,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:40:55,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [912284764] [2019-12-27 21:40:55,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:40:55,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:40:55,065 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 21:40:55,065 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:40:55,066 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:40:55,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:40:55,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:40:55,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:40:55,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:40:55,067 INFO L87 Difference]: Start difference. First operand 46842 states and 193636 transitions. Second operand 4 states. [2019-12-27 21:40:55,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:40:55,567 INFO L93 Difference]: Finished difference Result 57862 states and 237476 transitions. [2019-12-27 21:40:55,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:40:55,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 21:40:55,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:40:55,988 INFO L225 Difference]: With dead ends: 57862 [2019-12-27 21:40:55,988 INFO L226 Difference]: Without dead ends: 57862 [2019-12-27 21:40:55,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:40:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57862 states. [2019-12-27 21:40:59,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57862 to 51558. [2019-12-27 21:40:59,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51558 states. [2019-12-27 21:40:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51558 states to 51558 states and 212860 transitions. [2019-12-27 21:40:59,703 INFO L78 Accepts]: Start accepts. Automaton has 51558 states and 212860 transitions. Word has length 15 [2019-12-27 21:40:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:40:59,704 INFO L462 AbstractCegarLoop]: Abstraction has 51558 states and 212860 transitions. [2019-12-27 21:40:59,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:40:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 51558 states and 212860 transitions. [2019-12-27 21:40:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 21:40:59,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:40:59,717 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] [2019-12-27 21:40:59,717 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:40:59,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:40:59,717 INFO L82 PathProgramCache]: Analyzing trace with hash 188440407, now seen corresponding path program 1 times [2019-12-27 21:40:59,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:40:59,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734440177] [2019-12-27 21:40:59,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:40:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:40:59,826 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-27 21:40:59,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734440177] [2019-12-27 21:40:59,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:40:59,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:40:59,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791958827] [2019-12-27 21:40:59,827 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:40:59,830 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:40:59,837 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 21:40:59,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:40:59,875 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:40:59,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:40:59,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:40:59,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:40:59,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:40:59,877 INFO L87 Difference]: Start difference. First operand 51558 states and 212860 transitions. Second operand 6 states. [2019-12-27 21:41:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:00,520 INFO L93 Difference]: Finished difference Result 46492 states and 176838 transitions. [2019-12-27 21:41:00,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:41:00,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-27 21:41:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:00,652 INFO L225 Difference]: With dead ends: 46492 [2019-12-27 21:41:00,652 INFO L226 Difference]: Without dead ends: 45264 [2019-12-27 21:41:00,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:41:03,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45264 states. [2019-12-27 21:41:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45264 to 40332. [2019-12-27 21:41:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40332 states. [2019-12-27 21:41:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40332 states to 40332 states and 153743 transitions. [2019-12-27 21:41:03,700 INFO L78 Accepts]: Start accepts. Automaton has 40332 states and 153743 transitions. Word has length 21 [2019-12-27 21:41:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:03,701 INFO L462 AbstractCegarLoop]: Abstraction has 40332 states and 153743 transitions. [2019-12-27 21:41:03,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:41:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 40332 states and 153743 transitions. [2019-12-27 21:41:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:41:03,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:03,713 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] [2019-12-27 21:41:03,713 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:03,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:03,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1960384026, now seen corresponding path program 1 times [2019-12-27 21:41:03,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:03,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270433300] [2019-12-27 21:41:03,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:03,834 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-27 21:41:03,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270433300] [2019-12-27 21:41:03,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:03,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:41:03,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1663025335] [2019-12-27 21:41:03,835 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:03,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:03,849 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 122 transitions. [2019-12-27 21:41:03,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:04,081 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-12-27 21:41:04,163 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:41:04,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:41:04,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:04,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:41:04,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:41:04,164 INFO L87 Difference]: Start difference. First operand 40332 states and 153743 transitions. Second operand 11 states. [2019-12-27 21:41:04,509 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-12-27 21:41:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:06,110 INFO L93 Difference]: Finished difference Result 54047 states and 202278 transitions. [2019-12-27 21:41:06,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 21:41:06,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-12-27 21:41:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:06,226 INFO L225 Difference]: With dead ends: 54047 [2019-12-27 21:41:06,226 INFO L226 Difference]: Without dead ends: 54047 [2019-12-27 21:41:06,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:41:06,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54047 states. [2019-12-27 21:41:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54047 to 41032. [2019-12-27 21:41:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41032 states. [2019-12-27 21:41:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41032 states to 41032 states and 156226 transitions. [2019-12-27 21:41:07,554 INFO L78 Accepts]: Start accepts. Automaton has 41032 states and 156226 transitions. Word has length 22 [2019-12-27 21:41:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:07,554 INFO L462 AbstractCegarLoop]: Abstraction has 41032 states and 156226 transitions. [2019-12-27 21:41:07,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:41:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 41032 states and 156226 transitions. [2019-12-27 21:41:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:41:07,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:07,575 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] [2019-12-27 21:41:07,575 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:07,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:07,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1749218356, now seen corresponding path program 1 times [2019-12-27 21:41:07,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:07,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217328467] [2019-12-27 21:41:07,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:07,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:41:07,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217328467] [2019-12-27 21:41:07,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:07,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:41:07,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1178348830] [2019-12-27 21:41:07,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:07,712 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:07,726 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 114 transitions. [2019-12-27 21:41:07,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:07,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:41:07,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:41:07,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:41:07,774 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:41:07,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:41:07,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:07,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:41:07,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:41:07,776 INFO L87 Difference]: Start difference. First operand 41032 states and 156226 transitions. Second operand 7 states. [2019-12-27 21:41:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:09,482 INFO L93 Difference]: Finished difference Result 60612 states and 227389 transitions. [2019-12-27 21:41:09,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:41:09,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-27 21:41:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:09,610 INFO L225 Difference]: With dead ends: 60612 [2019-12-27 21:41:09,610 INFO L226 Difference]: Without dead ends: 60591 [2019-12-27 21:41:09,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:41:09,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60591 states. [2019-12-27 21:41:12,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60591 to 43230. [2019-12-27 21:41:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43230 states. [2019-12-27 21:41:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43230 states to 43230 states and 164934 transitions. [2019-12-27 21:41:12,805 INFO L78 Accepts]: Start accepts. Automaton has 43230 states and 164934 transitions. Word has length 26 [2019-12-27 21:41:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:12,806 INFO L462 AbstractCegarLoop]: Abstraction has 43230 states and 164934 transitions. [2019-12-27 21:41:12,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:41:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 43230 states and 164934 transitions. [2019-12-27 21:41:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 21:41:12,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:12,835 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] [2019-12-27 21:41:12,835 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:12,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:12,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1903836691, now seen corresponding path program 1 times [2019-12-27 21:41:12,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:12,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394706207] [2019-12-27 21:41:12,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:12,914 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-27 21:41:12,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394706207] [2019-12-27 21:41:12,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:12,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:41:12,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [363248859] [2019-12-27 21:41:12,916 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:12,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:12,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 42 transitions. [2019-12-27 21:41:12,930 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:12,930 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:41:12,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:41:12,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:12,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:41:12,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:41:12,932 INFO L87 Difference]: Start difference. First operand 43230 states and 164934 transitions. Second operand 3 states. [2019-12-27 21:41:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:13,193 INFO L93 Difference]: Finished difference Result 54365 states and 205393 transitions. [2019-12-27 21:41:13,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:41:13,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 21:41:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:13,307 INFO L225 Difference]: With dead ends: 54365 [2019-12-27 21:41:13,308 INFO L226 Difference]: Without dead ends: 54365 [2019-12-27 21:41:13,308 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-27 21:41:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54365 states. [2019-12-27 21:41:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54365 to 46901. [2019-12-27 21:41:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46901 states. [2019-12-27 21:41:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46901 states to 46901 states and 178542 transitions. [2019-12-27 21:41:14,603 INFO L78 Accepts]: Start accepts. Automaton has 46901 states and 178542 transitions. Word has length 30 [2019-12-27 21:41:14,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:14,604 INFO L462 AbstractCegarLoop]: Abstraction has 46901 states and 178542 transitions. [2019-12-27 21:41:14,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:41:14,604 INFO L276 IsEmpty]: Start isEmpty. Operand 46901 states and 178542 transitions. [2019-12-27 21:41:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 21:41:14,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:14,634 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] [2019-12-27 21:41:14,635 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1904073376, now seen corresponding path program 1 times [2019-12-27 21:41:14,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:14,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074862100] [2019-12-27 21:41:14,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:41:14,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074862100] [2019-12-27 21:41:14,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:14,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:41:14,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1576268820] [2019-12-27 21:41:14,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:14,723 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:14,732 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 42 transitions. [2019-12-27 21:41:14,732 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:14,733 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:41:14,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:41:14,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:14,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:41:14,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:41:14,734 INFO L87 Difference]: Start difference. First operand 46901 states and 178542 transitions. Second operand 5 states. [2019-12-27 21:41:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:14,850 INFO L93 Difference]: Finished difference Result 20516 states and 64639 transitions. [2019-12-27 21:41:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:41:14,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 21:41:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:14,878 INFO L225 Difference]: With dead ends: 20516 [2019-12-27 21:41:14,878 INFO L226 Difference]: Without dead ends: 19547 [2019-12-27 21:41:14,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:41:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19547 states. [2019-12-27 21:41:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19547 to 19547. [2019-12-27 21:41:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19547 states. [2019-12-27 21:41:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19547 states to 19547 states and 61538 transitions. [2019-12-27 21:41:15,683 INFO L78 Accepts]: Start accepts. Automaton has 19547 states and 61538 transitions. Word has length 30 [2019-12-27 21:41:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:15,683 INFO L462 AbstractCegarLoop]: Abstraction has 19547 states and 61538 transitions. [2019-12-27 21:41:15,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:41:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 19547 states and 61538 transitions. [2019-12-27 21:41:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 21:41:15,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:15,694 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] [2019-12-27 21:41:15,694 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:15,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:15,694 INFO L82 PathProgramCache]: Analyzing trace with hash 700126081, now seen corresponding path program 1 times [2019-12-27 21:41:15,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:15,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175706692] [2019-12-27 21:41:15,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:15,769 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-27 21:41:15,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175706692] [2019-12-27 21:41:15,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:15,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:41:15,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895921977] [2019-12-27 21:41:15,771 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:15,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:15,782 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 51 transitions. [2019-12-27 21:41:15,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:15,822 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:41:15,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:41:15,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:15,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:41:15,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:41:15,823 INFO L87 Difference]: Start difference. First operand 19547 states and 61538 transitions. Second operand 7 states. [2019-12-27 21:41:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:15,918 INFO L93 Difference]: Finished difference Result 3653 states and 9300 transitions. [2019-12-27 21:41:15,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:41:15,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-12-27 21:41:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:15,922 INFO L225 Difference]: With dead ends: 3653 [2019-12-27 21:41:15,923 INFO L226 Difference]: Without dead ends: 3248 [2019-12-27 21:41:15,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:41:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-12-27 21:41:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 3248. [2019-12-27 21:41:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3248 states. [2019-12-27 21:41:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 8158 transitions. [2019-12-27 21:41:15,954 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 8158 transitions. Word has length 31 [2019-12-27 21:41:15,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:15,954 INFO L462 AbstractCegarLoop]: Abstraction has 3248 states and 8158 transitions. [2019-12-27 21:41:15,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:41:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 8158 transitions. [2019-12-27 21:41:15,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 21:41:15,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:15,958 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] [2019-12-27 21:41:15,958 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:15,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:15,958 INFO L82 PathProgramCache]: Analyzing trace with hash -196360051, now seen corresponding path program 1 times [2019-12-27 21:41:15,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:15,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624522895] [2019-12-27 21:41:15,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:16,062 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-27 21:41:16,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624522895] [2019-12-27 21:41:16,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:16,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:41:16,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2141691959] [2019-12-27 21:41:16,063 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:16,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:16,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 275 transitions. [2019-12-27 21:41:16,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:16,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:41:16,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:41:16,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:16,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:41:16,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:41:16,180 INFO L87 Difference]: Start difference. First operand 3248 states and 8158 transitions. Second operand 9 states. [2019-12-27 21:41:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:16,415 INFO L93 Difference]: Finished difference Result 1470 states and 4119 transitions. [2019-12-27 21:41:16,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:41:16,415 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-12-27 21:41:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:16,418 INFO L225 Difference]: With dead ends: 1470 [2019-12-27 21:41:16,418 INFO L226 Difference]: Without dead ends: 1415 [2019-12-27 21:41:16,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:41:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-12-27 21:41:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1252. [2019-12-27 21:41:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2019-12-27 21:41:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 3544 transitions. [2019-12-27 21:41:16,440 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 3544 transitions. Word has length 43 [2019-12-27 21:41:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:16,442 INFO L462 AbstractCegarLoop]: Abstraction has 1252 states and 3544 transitions. [2019-12-27 21:41:16,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:41:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 3544 transitions. [2019-12-27 21:41:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:41:16,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:16,446 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-27 21:41:16,446 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:16,447 INFO L82 PathProgramCache]: Analyzing trace with hash 443866773, now seen corresponding path program 1 times [2019-12-27 21:41:16,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:16,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346855073] [2019-12-27 21:41:16,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:16,616 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-27 21:41:16,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346855073] [2019-12-27 21:41:16,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:16,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:41:16,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894462979] [2019-12-27 21:41:16,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:16,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:16,736 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 244 transitions. [2019-12-27 21:41:16,736 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:16,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 21:41:16,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:41:16,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:16,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:41:16,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:41:16,853 INFO L87 Difference]: Start difference. First operand 1252 states and 3544 transitions. Second operand 9 states. [2019-12-27 21:41:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:17,692 INFO L93 Difference]: Finished difference Result 2171 states and 6036 transitions. [2019-12-27 21:41:17,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 21:41:17,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-27 21:41:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:17,697 INFO L225 Difference]: With dead ends: 2171 [2019-12-27 21:41:17,697 INFO L226 Difference]: Without dead ends: 2171 [2019-12-27 21:41:17,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:41:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2019-12-27 21:41:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1601. [2019-12-27 21:41:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-12-27 21:41:17,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 4446 transitions. [2019-12-27 21:41:17,733 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 4446 transitions. Word has length 58 [2019-12-27 21:41:17,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:17,733 INFO L462 AbstractCegarLoop]: Abstraction has 1601 states and 4446 transitions. [2019-12-27 21:41:17,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:41:17,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 4446 transitions. [2019-12-27 21:41:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:41:17,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:17,737 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-27 21:41:17,738 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:17,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:17,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1535525935, now seen corresponding path program 2 times [2019-12-27 21:41:17,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:17,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666104229] [2019-12-27 21:41:17,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:17,863 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-27 21:41:17,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666104229] [2019-12-27 21:41:17,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:17,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:41:17,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164523030] [2019-12-27 21:41:17,864 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:17,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:17,986 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 213 transitions. [2019-12-27 21:41:17,986 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:18,032 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 21:41:18,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:41:18,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:18,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:41:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:41:18,037 INFO L87 Difference]: Start difference. First operand 1601 states and 4446 transitions. Second operand 8 states. [2019-12-27 21:41:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:18,382 INFO L93 Difference]: Finished difference Result 2442 states and 6716 transitions. [2019-12-27 21:41:18,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:41:18,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-27 21:41:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:18,387 INFO L225 Difference]: With dead ends: 2442 [2019-12-27 21:41:18,387 INFO L226 Difference]: Without dead ends: 2442 [2019-12-27 21:41:18,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:41:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2019-12-27 21:41:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 1529. [2019-12-27 21:41:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1529 states. [2019-12-27 21:41:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 4238 transitions. [2019-12-27 21:41:18,407 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 4238 transitions. Word has length 58 [2019-12-27 21:41:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:18,408 INFO L462 AbstractCegarLoop]: Abstraction has 1529 states and 4238 transitions. [2019-12-27 21:41:18,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:41:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 4238 transitions. [2019-12-27 21:41:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:41:18,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:18,411 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-27 21:41:18,411 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash 900965748, now seen corresponding path program 1 times [2019-12-27 21:41:18,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:18,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903450963] [2019-12-27 21:41:18,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:18,484 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-27 21:41:18,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903450963] [2019-12-27 21:41:18,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:18,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:41:18,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [121608205] [2019-12-27 21:41:18,485 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:18,504 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:18,626 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 248 transitions. [2019-12-27 21:41:18,626 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:18,626 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:41:18,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:41:18,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:41:18,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:41:18,627 INFO L87 Difference]: Start difference. First operand 1529 states and 4238 transitions. Second operand 3 states. [2019-12-27 21:41:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:18,675 INFO L93 Difference]: Finished difference Result 1528 states and 4236 transitions. [2019-12-27 21:41:18,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:41:18,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 21:41:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:18,679 INFO L225 Difference]: With dead ends: 1528 [2019-12-27 21:41:18,679 INFO L226 Difference]: Without dead ends: 1528 [2019-12-27 21:41:18,679 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-27 21:41:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2019-12-27 21:41:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1223. [2019-12-27 21:41:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-27 21:41:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3394 transitions. [2019-12-27 21:41:18,693 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3394 transitions. Word has length 59 [2019-12-27 21:41:18,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:18,694 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3394 transitions. [2019-12-27 21:41:18,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:41:18,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3394 transitions. [2019-12-27 21:41:18,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 21:41:18,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:18,696 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-27 21:41:18,696 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:18,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:18,696 INFO L82 PathProgramCache]: Analyzing trace with hash 435926507, now seen corresponding path program 1 times [2019-12-27 21:41:18,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:18,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309900584] [2019-12-27 21:41:18,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:18,766 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-27 21:41:18,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309900584] [2019-12-27 21:41:18,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:18,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:41:18,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [758088647] [2019-12-27 21:41:18,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:18,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:18,891 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 228 transitions. [2019-12-27 21:41:18,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:18,893 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:41:18,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:41:18,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:18,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:41:18,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:41:18,894 INFO L87 Difference]: Start difference. First operand 1223 states and 3394 transitions. Second operand 3 states. [2019-12-27 21:41:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:18,910 INFO L93 Difference]: Finished difference Result 1159 states and 3186 transitions. [2019-12-27 21:41:18,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:41:18,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-27 21:41:18,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:18,912 INFO L225 Difference]: With dead ends: 1159 [2019-12-27 21:41:18,912 INFO L226 Difference]: Without dead ends: 1159 [2019-12-27 21:41:18,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-27 21:41:18,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-12-27 21:41:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2019-12-27 21:41:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1159 states. [2019-12-27 21:41:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 3186 transitions. [2019-12-27 21:41:18,931 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 3186 transitions. Word has length 59 [2019-12-27 21:41:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:18,932 INFO L462 AbstractCegarLoop]: Abstraction has 1159 states and 3186 transitions. [2019-12-27 21:41:18,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:41:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 3186 transitions. [2019-12-27 21:41:18,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:41:18,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:18,935 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-27 21:41:18,935 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:18,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash 319016150, now seen corresponding path program 1 times [2019-12-27 21:41:18,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:18,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473611910] [2019-12-27 21:41:18,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:19,061 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-27 21:41:19,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473611910] [2019-12-27 21:41:19,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:19,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:41:19,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5349383] [2019-12-27 21:41:19,062 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:19,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:19,223 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 258 transitions. [2019-12-27 21:41:19,223 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:19,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:41:19,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:41:19,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:19,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:41:19,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:41:19,227 INFO L87 Difference]: Start difference. First operand 1159 states and 3186 transitions. Second operand 6 states. [2019-12-27 21:41:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:19,293 INFO L93 Difference]: Finished difference Result 1629 states and 4212 transitions. [2019-12-27 21:41:19,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:41:19,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-27 21:41:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:19,296 INFO L225 Difference]: With dead ends: 1629 [2019-12-27 21:41:19,297 INFO L226 Difference]: Without dead ends: 1019 [2019-12-27 21:41:19,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:41:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-12-27 21:41:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2019-12-27 21:41:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-12-27 21:41:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 2715 transitions. [2019-12-27 21:41:19,315 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 2715 transitions. Word has length 60 [2019-12-27 21:41:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:19,315 INFO L462 AbstractCegarLoop]: Abstraction has 1019 states and 2715 transitions. [2019-12-27 21:41:19,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:41:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 2715 transitions. [2019-12-27 21:41:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:41:19,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:19,318 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-27 21:41:19,318 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:19,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:19,318 INFO L82 PathProgramCache]: Analyzing trace with hash 792391964, now seen corresponding path program 2 times [2019-12-27 21:41:19,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:19,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779085616] [2019-12-27 21:41:19,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:19,458 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-27 21:41:19,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779085616] [2019-12-27 21:41:19,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:19,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:41:19,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [153785953] [2019-12-27 21:41:19,459 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:19,478 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:19,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 270 transitions. [2019-12-27 21:41:19,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:19,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:41:19,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:41:19,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:41:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:41:19,665 INFO L87 Difference]: Start difference. First operand 1019 states and 2715 transitions. Second operand 8 states. [2019-12-27 21:41:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:19,915 INFO L93 Difference]: Finished difference Result 1958 states and 4862 transitions. [2019-12-27 21:41:19,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:41:19,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-27 21:41:19,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:19,917 INFO L225 Difference]: With dead ends: 1958 [2019-12-27 21:41:19,918 INFO L226 Difference]: Without dead ends: 795 [2019-12-27 21:41:19,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:41:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-12-27 21:41:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 570. [2019-12-27 21:41:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-12-27 21:41:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1221 transitions. [2019-12-27 21:41:19,928 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1221 transitions. Word has length 60 [2019-12-27 21:41:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:19,928 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 1221 transitions. [2019-12-27 21:41:19,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:41:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1221 transitions. [2019-12-27 21:41:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:41:19,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:19,929 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-27 21:41:19,930 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:19,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:19,930 INFO L82 PathProgramCache]: Analyzing trace with hash -631890150, now seen corresponding path program 3 times [2019-12-27 21:41:19,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:19,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693739949] [2019-12-27 21:41:19,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:20,087 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-27 21:41:20,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693739949] [2019-12-27 21:41:20,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:20,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:41:20,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [84134971] [2019-12-27 21:41:20,089 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:20,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:20,251 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 181 transitions. [2019-12-27 21:41:20,251 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:20,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:41:20,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:41:20,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:20,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:41:20,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:41:20,270 INFO L87 Difference]: Start difference. First operand 570 states and 1221 transitions. Second operand 7 states. [2019-12-27 21:41:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:20,509 INFO L93 Difference]: Finished difference Result 953 states and 1987 transitions. [2019-12-27 21:41:20,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:41:20,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-27 21:41:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:20,510 INFO L225 Difference]: With dead ends: 953 [2019-12-27 21:41:20,511 INFO L226 Difference]: Without dead ends: 303 [2019-12-27 21:41:20,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:41:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-27 21:41:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 214. [2019-12-27 21:41:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-27 21:41:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 362 transitions. [2019-12-27 21:41:20,515 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 362 transitions. Word has length 60 [2019-12-27 21:41:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:20,515 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 362 transitions. [2019-12-27 21:41:20,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:41:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 362 transitions. [2019-12-27 21:41:20,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:41:20,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:20,516 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-27 21:41:20,516 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:20,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:20,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1041044752, now seen corresponding path program 4 times [2019-12-27 21:41:20,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:20,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324071626] [2019-12-27 21:41:20,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:41:20,745 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-27 21:41:20,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324071626] [2019-12-27 21:41:20,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:41:20,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:41:20,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1252416572] [2019-12-27 21:41:20,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:41:20,763 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:41:20,834 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 125 transitions. [2019-12-27 21:41:20,834 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:41:20,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:41:20,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:41:20,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:41:20,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:41:20,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:41:20,883 INFO L87 Difference]: Start difference. First operand 214 states and 362 transitions. Second operand 13 states. [2019-12-27 21:41:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:41:21,356 INFO L93 Difference]: Finished difference Result 364 states and 605 transitions. [2019-12-27 21:41:21,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:41:21,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-27 21:41:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:41:21,358 INFO L225 Difference]: With dead ends: 364 [2019-12-27 21:41:21,358 INFO L226 Difference]: Without dead ends: 332 [2019-12-27 21:41:21,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:41:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-12-27 21:41:21,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 322. [2019-12-27 21:41:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-12-27 21:41:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 547 transitions. [2019-12-27 21:41:21,363 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 547 transitions. Word has length 60 [2019-12-27 21:41:21,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:41:21,363 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 547 transitions. [2019-12-27 21:41:21,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:41:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 547 transitions. [2019-12-27 21:41:21,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 21:41:21,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:41:21,364 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-27 21:41:21,364 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:41:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:41:21,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1167049754, now seen corresponding path program 5 times [2019-12-27 21:41:21,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:41:21,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229774510] [2019-12-27 21:41:21,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:41:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:41:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:41:21,487 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:41:21,487 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:41:21,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~__unbuffered_p3_EAX~0_10) (= v_~z$r_buff0_thd4~0_27 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_26 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~z$r_buff1_thd3~0_18) (< 0 |v_#StackHeapBarrier_21|) (= v_~x~0_13 0) (= 0 v_~z$w_buff1~0_21) (= 0 v_~z$r_buff1_thd4~0_20) (= 0 v_~z$flush_delayed~0_15) (= (select .cse0 |v_ULTIMATE.start_main_~#t1469~0.base_22|) 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd3~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= v_~z$w_buff0_used~0_105 0) (= 0 v_~z$r_buff1_thd0~0_48) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~__unbuffered_cnt~0_27) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1469~0.base_22| 4)) (= 0 |v_ULTIMATE.start_main_~#t1469~0.offset_17|) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$r_buff0_thd2~0_9 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$w_buff1_used~0_65) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1469~0.base_22|) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1469~0.base_22| 1)) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1469~0.base_22| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1469~0.base_22|) |v_ULTIMATE.start_main_~#t1469~0.offset_17| 0)) |v_#memory_int_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1470~0.offset=|v_ULTIMATE.start_main_~#t1470~0.offset_18|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, ULTIMATE.start_main_~#t1470~0.base=|v_ULTIMATE.start_main_~#t1470~0.base_23|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_17|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, #length=|v_#length_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_16|, ULTIMATE.start_main_~#t1471~0.base=|v_ULTIMATE.start_main_~#t1471~0.base_20|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_13|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_16|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ULTIMATE.start_main_~#t1472~0.base=|v_ULTIMATE.start_main_~#t1472~0.base_20|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~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_19, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~x~0=v_~x~0_13, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_20, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ~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_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_16|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_48, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_9|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_18, ULTIMATE.start_main_~#t1469~0.base=|v_ULTIMATE.start_main_~#t1469~0.base_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_17|, ULTIMATE.start_main_~#t1472~0.offset=|v_ULTIMATE.start_main_~#t1472~0.offset_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_~#t1471~0.offset=|v_ULTIMATE.start_main_~#t1471~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t1469~0.offset=|v_ULTIMATE.start_main_~#t1469~0.offset_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1470~0.offset, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1470~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #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, ~__unbuffered_p1_EAX~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, ULTIMATE.start_main_~#t1471~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1472~0.base, ~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, ~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, ~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_~#t1469~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1472~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1471~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1469~0.offset, 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-27 21:41:21,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L823-1-->L825: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1470~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1470~0.offset_11| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1470~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1470~0.base_13|) |v_ULTIMATE.start_main_~#t1470~0.offset_11| 1)) |v_#memory_int_19|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1470~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1470~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1470~0.base_13| 0)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1470~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1470~0.offset=|v_ULTIMATE.start_main_~#t1470~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1470~0.base=|v_ULTIMATE.start_main_~#t1470~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1470~0.offset, ULTIMATE.start_main_~#t1470~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 21:41:21,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L825-1-->L827: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1471~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1471~0.base_10|) |v_ULTIMATE.start_main_~#t1471~0.offset_10| 2)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1471~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1471~0.base_10|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1471~0.base_10| 1) |v_#valid_40|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1471~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1471~0.offset_10| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1471~0.base_10| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1471~0.offset=|v_ULTIMATE.start_main_~#t1471~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1471~0.base=|v_ULTIMATE.start_main_~#t1471~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1471~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1471~0.base] because there is no mapped edge [2019-12-27 21:41:21,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L827-1-->L829: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1472~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1472~0.offset_10| 0) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1472~0.base_11| 1) |v_#valid_44|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1472~0.base_11|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1472~0.base_11| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1472~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1472~0.base_11|) |v_ULTIMATE.start_main_~#t1472~0.offset_10| 3)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1472~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1472~0.base=|v_ULTIMATE.start_main_~#t1472~0.base_11|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1472~0.offset=|v_ULTIMATE.start_main_~#t1472~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1472~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1472~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-27 21:41:21,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L4-->L800: Formula: (and (= ~z$r_buff0_thd0~0_In-1428709607 ~z$r_buff1_thd0~0_Out-1428709607) (= ~z$r_buff1_thd4~0_Out-1428709607 ~z$r_buff0_thd4~0_In-1428709607) (= ~z$r_buff1_thd2~0_Out-1428709607 ~z$r_buff0_thd2~0_In-1428709607) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1428709607)) (= 1 ~z$r_buff0_thd4~0_Out-1428709607) (= ~a~0_In-1428709607 ~__unbuffered_p3_EAX~0_Out-1428709607) (= ~z$r_buff0_thd3~0_In-1428709607 ~z$r_buff1_thd3~0_Out-1428709607) (= ~z$r_buff0_thd1~0_In-1428709607 ~z$r_buff1_thd1~0_Out-1428709607)) InVars {~a~0=~a~0_In-1428709607, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1428709607, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1428709607, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1428709607, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1428709607, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1428709607, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1428709607} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In-1428709607, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1428709607, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1428709607, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1428709607, ~a~0=~a~0_In-1428709607, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1428709607, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1428709607, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1428709607, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1428709607, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1428709607, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1428709607, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1428709607, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1428709607} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 21:41:21,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~a~0_6) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, ~x~0=v_~x~0_9, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:41:21,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_7) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_~x~0_10 2) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y~0=v_~y~0_7} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_7, ~x~0=v_~x~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 21:41:21,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In757648101 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In757648101 256)))) (or (and (= ~z$w_buff0_used~0_In757648101 |P3Thread1of1ForFork3_#t~ite11_Out757648101|) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork3_#t~ite11_Out757648101|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In757648101, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In757648101} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In757648101, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In757648101, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out757648101|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 21:41:21,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1017840564 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1017840564 256) 0))) (or (and (= ~z~0_In-1017840564 |P2Thread1of1ForFork2_#t~ite3_Out-1017840564|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In-1017840564 |P2Thread1of1ForFork2_#t~ite3_Out-1017840564|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1017840564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017840564, ~z$w_buff1~0=~z$w_buff1~0_In-1017840564, ~z~0=~z~0_In-1017840564} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1017840564|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1017840564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017840564, ~z$w_buff1~0=~z$w_buff1~0_In-1017840564, ~z~0=~z~0_In-1017840564} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 21:41:21,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 21:41:21,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In1276502487 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1276502487 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1276502487 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1276502487 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out1276502487| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1276502487 |P3Thread1of1ForFork3_#t~ite12_Out1276502487|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1276502487, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1276502487, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1276502487, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1276502487} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1276502487, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1276502487, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1276502487, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1276502487, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1276502487|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 21:41:21,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1229589958 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1229589958 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1229589958) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out1229589958 ~z$r_buff0_thd4~0_In1229589958) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1229589958, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1229589958} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1229589958, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1229589958, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1229589958|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 21:41:21,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1830661469 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1830661469 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1830661469 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In1830661469 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out1830661469| ~z$r_buff1_thd4~0_In1830661469)) (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out1830661469|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1830661469, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1830661469, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1830661469, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1830661469} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1830661469, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1830661469, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1830661469|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1830661469, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1830661469} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 21:41:21,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L804-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_16) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 21:41:21,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1077043029 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1077043029 256) 0))) (or (and (= ~z$w_buff0_used~0_In1077043029 |P2Thread1of1ForFork2_#t~ite5_Out1077043029|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out1077043029| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1077043029, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1077043029} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1077043029|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1077043029, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1077043029} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 21:41:21,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-587418572 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-587418572 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-587418572 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-587418572 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out-587418572| ~z$w_buff1_used~0_In-587418572) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-587418572| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-587418572, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-587418572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-587418572, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-587418572} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-587418572|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-587418572, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-587418572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-587418572, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-587418572} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 21:41:21,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1510132730 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1510132730 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-1510132730| ~z$r_buff0_thd3~0_In-1510132730)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out-1510132730| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1510132730, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1510132730} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1510132730, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1510132730, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1510132730|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 21:41:21,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-684085476 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-684085476 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-684085476 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-684085476 256) 0))) (or (and (= ~z$r_buff1_thd3~0_In-684085476 |P2Thread1of1ForFork2_#t~ite8_Out-684085476|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-684085476|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-684085476, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-684085476, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-684085476, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-684085476} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-684085476, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-684085476, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-684085476, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-684085476, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-684085476|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:41:21,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_24 1) v_~__unbuffered_cnt~0_23) (= v_~z$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 21:41:21,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_50 256)) (= 0 (mod v_~z$w_buff0_used~0_72 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_50, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_72, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 21:41:21,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1518439797 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1518439797 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In1518439797 |ULTIMATE.start_main_#t~ite19_Out1518439797|) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In1518439797 |ULTIMATE.start_main_#t~ite19_Out1518439797|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1518439797, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1518439797, ~z$w_buff1~0=~z$w_buff1~0_In1518439797, ~z~0=~z~0_In1518439797} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1518439797|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1518439797, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1518439797, ~z$w_buff1~0=~z$w_buff1~0_In1518439797, ~z~0=~z~0_In1518439797} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 21:41:21,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite19_7|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~z~0=v_~z~0_18, 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-27 21:41:21,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In343713246 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In343713246 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out343713246|)) (and (= ~z$w_buff0_used~0_In343713246 |ULTIMATE.start_main_#t~ite21_Out343713246|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In343713246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In343713246} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In343713246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In343713246, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out343713246|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 21:41:21,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1738284657 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1738284657 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1738284657 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1738284657 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1738284657 |ULTIMATE.start_main_#t~ite22_Out-1738284657|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite22_Out-1738284657| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1738284657, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1738284657, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1738284657, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1738284657} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1738284657, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1738284657, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1738284657, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1738284657, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1738284657|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 21:41:21,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In710919720 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In710919720 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out710919720| ~z$r_buff0_thd0~0_In710919720)) (and (= |ULTIMATE.start_main_#t~ite23_Out710919720| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In710919720, ~z$w_buff0_used~0=~z$w_buff0_used~0_In710919720} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In710919720, ~z$w_buff0_used~0=~z$w_buff0_used~0_In710919720, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out710919720|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 21:41:21,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1923838268 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1923838268 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1923838268 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1923838268 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out1923838268| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite24_Out1923838268| ~z$r_buff1_thd0~0_In1923838268)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1923838268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1923838268, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1923838268, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1923838268} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1923838268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1923838268, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1923838268, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1923838268|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1923838268} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 21:41:21,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L848-->L848-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1789725700 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In1789725700 |ULTIMATE.start_main_#t~ite34_Out1789725700|) (= |ULTIMATE.start_main_#t~ite33_In1789725700| |ULTIMATE.start_main_#t~ite33_Out1789725700|)) (and (= ~z$w_buff1~0_In1789725700 |ULTIMATE.start_main_#t~ite33_Out1789725700|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1789725700 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1789725700 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In1789725700 256) 0)) (= (mod ~z$w_buff0_used~0_In1789725700 256) 0))) (= |ULTIMATE.start_main_#t~ite33_Out1789725700| |ULTIMATE.start_main_#t~ite34_Out1789725700|) .cse0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1789725700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1789725700, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1789725700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1789725700, ~z$w_buff1~0=~z$w_buff1~0_In1789725700, ~weak$$choice2~0=~weak$$choice2~0_In1789725700, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In1789725700|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1789725700, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1789725700, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1789725700, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1789725700, ~z$w_buff1~0=~z$w_buff1~0_In1789725700, ~weak$$choice2~0=~weak$$choice2~0_In1789725700, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1789725700|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1789725700|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 21:41:21,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L850-->L850-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In42756430 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In42756430 256) 0))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In42756430 256))) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In42756430 256))) (= (mod ~z$w_buff0_used~0_In42756430 256) 0))) (= |ULTIMATE.start_main_#t~ite40_Out42756430| |ULTIMATE.start_main_#t~ite39_Out42756430|) .cse1 (= ~z$w_buff1_used~0_In42756430 |ULTIMATE.start_main_#t~ite39_Out42756430|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite39_In42756430| |ULTIMATE.start_main_#t~ite39_Out42756430|) (= ~z$w_buff1_used~0_In42756430 |ULTIMATE.start_main_#t~ite40_Out42756430|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In42756430, ~z$w_buff0_used~0=~z$w_buff0_used~0_In42756430, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In42756430|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In42756430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In42756430, ~weak$$choice2~0=~weak$$choice2~0_In42756430} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In42756430, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out42756430|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out42756430|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In42756430, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In42756430, ~z$w_buff1_used~0=~z$w_buff1_used~0_In42756430, ~weak$$choice2~0=~weak$$choice2~0_In42756430} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:41:21,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} 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-27 21:41:21,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L852-->L852-8: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite46_Out-260447563| |ULTIMATE.start_main_#t~ite45_Out-260447563|)) (.cse4 (= (mod ~z$w_buff1_used~0_In-260447563 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-260447563 256) 0)) (.cse6 (= 0 (mod ~z$r_buff0_thd0~0_In-260447563 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-260447563 256))) (.cse5 (= (mod ~weak$$choice2~0_In-260447563 256) 0))) (or (let ((.cse1 (not .cse6))) (and (= |ULTIMATE.start_main_#t~ite44_Out-260447563| 0) .cse0 (or .cse1 (not .cse2)) (not .cse3) (or (not .cse4) .cse1) .cse5 (= |ULTIMATE.start_main_#t~ite44_Out-260447563| |ULTIMATE.start_main_#t~ite45_Out-260447563|))) (and (or (and (= ~z$r_buff1_thd0~0_In-260447563 |ULTIMATE.start_main_#t~ite45_Out-260447563|) .cse0 (or (and .cse4 .cse6) (and .cse2 .cse6) .cse3) .cse5) (and (= |ULTIMATE.start_main_#t~ite45_In-260447563| |ULTIMATE.start_main_#t~ite45_Out-260447563|) (not .cse5) (= |ULTIMATE.start_main_#t~ite46_Out-260447563| ~z$r_buff1_thd0~0_In-260447563))) (= |ULTIMATE.start_main_#t~ite44_In-260447563| |ULTIMATE.start_main_#t~ite44_Out-260447563|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-260447563, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-260447563, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-260447563, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-260447563, ~weak$$choice2~0=~weak$$choice2~0_In-260447563, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-260447563|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-260447563|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-260447563, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-260447563, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-260447563, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-260447563, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-260447563|, ~weak$$choice2~0=~weak$$choice2~0_In-260447563, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-260447563|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-260447563|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:41:21,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_22 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, 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-27 21:41:21,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 21:41:21,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:41:21 BasicIcfg [2019-12-27 21:41:21,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:41:21,598 INFO L168 Benchmark]: Toolchain (without parser) took 43860.65 ms. Allocated memory was 144.2 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 100.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 939.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:41:21,599 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 21:41:21,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.55 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 154.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:41:21,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.92 ms. Allocated memory is still 200.8 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:41:21,601 INFO L168 Benchmark]: Boogie Preprocessor took 38.65 ms. Allocated memory is still 200.8 MB. Free memory was 151.0 MB in the beginning and 148.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:41:21,601 INFO L168 Benchmark]: RCFGBuilder took 831.93 ms. Allocated memory is still 200.8 MB. Free memory was 148.3 MB in the beginning and 99.3 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:41:21,602 INFO L168 Benchmark]: TraceAbstraction took 42171.65 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 99.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 882.0 MB. Max. memory is 7.1 GB. [2019-12-27 21:41:21,605 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.21 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 728.55 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 154.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.92 ms. Allocated memory is still 200.8 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.65 ms. Allocated memory is still 200.8 MB. Free memory was 151.0 MB in the beginning and 148.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 831.93 ms. Allocated memory is still 200.8 MB. Free memory was 148.3 MB in the beginning and 99.3 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42171.65 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 99.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 882.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 96 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 4854 VarBasedMoverChecksPositive, 171 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51526 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L823] FCALL, FORK 0 pthread_create(&t1469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L825] FCALL, FORK 0 pthread_create(&t1470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L827] FCALL, FORK 0 pthread_create(&t1471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L829] FCALL, FORK 0 pthread_create(&t1472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L784] 4 z$w_buff1 = z$w_buff0 [L785] 4 z$w_buff0 = 2 [L786] 4 z$w_buff1_used = z$w_buff0_used [L787] 4 z$w_buff0_used = (_Bool)1 [L800] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L764] 3 y = 1 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __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=1, 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] [L800] 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) [L770] 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_p1_EAX=0, __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=1, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L802] 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 [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 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 [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __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=1, 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] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 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 [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L839] 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 [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 z$flush_delayed = weak$$choice2 [L845] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __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=1, 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] 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_p1_EAX=0, __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=1, 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 = !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) [L847] 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_p1_EAX=0, __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=1, 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 = 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)) [L848] 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)) [L849] 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_p1_EAX=0, __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=1, 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] [L849] 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)) [L850] 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)) [L852] 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)) [L853] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __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=1, 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, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 41.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2248 SDtfs, 3096 SDslu, 5725 SDs, 0 SdLazy, 3672 SolverSat, 300 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 82 SyntacticMatches, 24 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51558occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 56831 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 776 NumberOfCodeBlocks, 776 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 698 ConstructedInterpolants, 0 QuantifiedInterpolants, 124905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...