/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:56:50,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:56:50,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:56:50,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:56:50,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:56:50,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:56:50,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:56:50,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:56:50,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:56:50,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:56:50,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:56:50,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:56:50,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:56:50,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:56:50,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:56:50,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:56:50,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:56:50,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:56:50,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:56:50,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:56:50,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:56:50,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:56:50,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:56:50,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:56:50,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:56:50,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:56:50,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:56:50,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:56:50,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:56:50,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:56:50,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:56:50,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:56:50,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:56:50,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:56:50,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:56:50,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:56:50,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:56:50,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:56:50,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:56:50,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:56:50,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:56:50,553 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:56:50,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:56:50,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:56:50,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:56:50,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:56:50,584 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:56:50,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:56:50,584 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:56:50,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:56:50,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:56:50,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:56:50,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:56:50,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:56:50,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:56:50,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:56:50,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:56:50,587 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:56:50,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:56:50,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:56:50,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:56:50,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:56:50,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:56:50,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:56:50,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:56:50,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:56:50,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:56:50,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:56:50,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:56:50,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:56:50,595 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:56:50,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:56:50,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:56:50,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:56:50,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:56:50,887 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:56:50,888 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:56:50,888 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-18 13:56:50,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b231252/f240acd19dc141808abaaa36658c84e2/FLAG747e4edf4 [2019-12-18 13:56:51,487 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:56:51,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_pso.opt.i [2019-12-18 13:56:51,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b231252/f240acd19dc141808abaaa36658c84e2/FLAG747e4edf4 [2019-12-18 13:56:51,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b231252/f240acd19dc141808abaaa36658c84e2 [2019-12-18 13:56:51,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:56:51,800 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:56:51,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:56:51,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:56:51,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:56:51,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:56:51" (1/1) ... [2019-12-18 13:56:51,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:51, skipping insertion in model container [2019-12-18 13:56:51,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:56:51" (1/1) ... [2019-12-18 13:56:51,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:56:51,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:56:52,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:56:52,448 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:56:52,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:56:52,593 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:56:52,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52 WrapperNode [2019-12-18 13:56:52,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:56:52,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:56:52,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:56:52,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:56:52,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52" (1/1) ... [2019-12-18 13:56:52,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52" (1/1) ... [2019-12-18 13:56:52,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:56:52,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:56:52,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:56:52,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:56:52,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52" (1/1) ... [2019-12-18 13:56:52,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52" (1/1) ... [2019-12-18 13:56:52,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52" (1/1) ... [2019-12-18 13:56:52,670 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52" (1/1) ... [2019-12-18 13:56:52,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52" (1/1) ... [2019-12-18 13:56:52,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52" (1/1) ... [2019-12-18 13:56:52,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52" (1/1) ... [2019-12-18 13:56:52,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:56:52,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:56:52,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:56:52,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:56:52,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:56:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:56:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:56:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:56:52,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:56:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:56:52,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:56:52,763 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:56:52,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:56:52,764 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:56:52,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:56:52,765 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 13:56:52,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 13:56:52,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:56:52,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:56:52,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:56:52,769 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:56:53,545 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:56:53,546 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:56:53,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:56:53 BoogieIcfgContainer [2019-12-18 13:56:53,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:56:53,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:56:53,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:56:53,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:56:53,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:56:51" (1/3) ... [2019-12-18 13:56:53,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51eaad32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:56:53, skipping insertion in model container [2019-12-18 13:56:53,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:56:52" (2/3) ... [2019-12-18 13:56:53,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51eaad32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:56:53, skipping insertion in model container [2019-12-18 13:56:53,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:56:53" (3/3) ... [2019-12-18 13:56:53,556 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_pso.opt.i [2019-12-18 13:56:53,567 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:56:53,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:56:53,577 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:56:53,578 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:56:53,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,616 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,620 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,620 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,628 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,628 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,629 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,629 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,629 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,659 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,660 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,663 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,663 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,666 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,666 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,667 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,668 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,668 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:56:53,684 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 13:56:53,702 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:56:53,703 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:56:53,703 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:56:53,703 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:56:53,703 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:56:53,703 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:56:53,703 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:56:53,704 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:56:53,720 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 207 transitions [2019-12-18 13:56:53,722 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 13:56:53,818 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 13:56:53,819 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:56:53,834 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. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:56:53,857 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 207 transitions [2019-12-18 13:56:53,900 INFO L126 PetriNetUnfolder]: 41/203 cut-off events. [2019-12-18 13:56:53,901 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:56:53,908 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. 12/172 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 13:56:53,923 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 13:56:53,924 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:56:58,866 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 13:56:59,017 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 13:56:59,047 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50860 [2019-12-18 13:56:59,047 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 13:56:59,051 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 97 transitions [2019-12-18 13:57:01,175 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 13:57:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 13:57:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 13:57:01,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:01,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:01,186 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-18 13:57:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:01,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1893967926, now seen corresponding path program 1 times [2019-12-18 13:57:01,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:01,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588351791] [2019-12-18 13:57:01,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:01,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588351791] [2019-12-18 13:57:01,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:01,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:57:01,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951635723] [2019-12-18 13:57:01,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:57:01,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:57:01,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:57:01,482 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 13:57:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:02,906 INFO L93 Difference]: Finished difference Result 34366 states and 145832 transitions. [2019-12-18 13:57:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:57:02,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 13:57:02,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:03,165 INFO L225 Difference]: With dead ends: 34366 [2019-12-18 13:57:03,166 INFO L226 Difference]: Without dead ends: 33694 [2019-12-18 13:57:03,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:57:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33694 states. [2019-12-18 13:57:05,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33694 to 33694. [2019-12-18 13:57:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33694 states. [2019-12-18 13:57:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33694 states to 33694 states and 143088 transitions. [2019-12-18 13:57:06,176 INFO L78 Accepts]: Start accepts. Automaton has 33694 states and 143088 transitions. Word has length 9 [2019-12-18 13:57:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:06,178 INFO L462 AbstractCegarLoop]: Abstraction has 33694 states and 143088 transitions. [2019-12-18 13:57:06,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:57:06,178 INFO L276 IsEmpty]: Start isEmpty. Operand 33694 states and 143088 transitions. [2019-12-18 13:57:06,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:57:06,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:06,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:06,191 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-18 13:57:06,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:06,191 INFO L82 PathProgramCache]: Analyzing trace with hash 706074371, now seen corresponding path program 1 times [2019-12-18 13:57:06,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:06,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837661413] [2019-12-18 13:57:06,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:06,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837661413] [2019-12-18 13:57:06,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:06,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:57:06,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835064283] [2019-12-18 13:57:06,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:57:06,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:06,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:57:06,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:57:06,329 INFO L87 Difference]: Start difference. First operand 33694 states and 143088 transitions. Second operand 4 states. [2019-12-18 13:57:07,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:07,337 INFO L93 Difference]: Finished difference Result 52350 states and 214840 transitions. [2019-12-18 13:57:07,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:57:07,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:57:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:07,603 INFO L225 Difference]: With dead ends: 52350 [2019-12-18 13:57:07,604 INFO L226 Difference]: Without dead ends: 52322 [2019-12-18 13:57:07,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:57:08,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-18 13:57:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47546. [2019-12-18 13:57:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47546 states. [2019-12-18 13:57:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47546 states to 47546 states and 197076 transitions. [2019-12-18 13:57:09,540 INFO L78 Accepts]: Start accepts. Automaton has 47546 states and 197076 transitions. Word has length 15 [2019-12-18 13:57:09,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:09,540 INFO L462 AbstractCegarLoop]: Abstraction has 47546 states and 197076 transitions. [2019-12-18 13:57:09,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:57:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 47546 states and 197076 transitions. [2019-12-18 13:57:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:57:09,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:09,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:09,544 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-18 13:57:09,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:09,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1899832342, now seen corresponding path program 1 times [2019-12-18 13:57:09,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:09,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415627116] [2019-12-18 13:57:09,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:11,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415627116] [2019-12-18 13:57:11,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:11,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:57:11,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168507799] [2019-12-18 13:57:11,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:57:11,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:11,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:57:11,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:57:11,811 INFO L87 Difference]: Start difference. First operand 47546 states and 197076 transitions. Second operand 4 states. [2019-12-18 13:57:12,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:12,263 INFO L93 Difference]: Finished difference Result 58566 states and 240916 transitions. [2019-12-18 13:57:12,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:57:12,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 13:57:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:12,432 INFO L225 Difference]: With dead ends: 58566 [2019-12-18 13:57:12,433 INFO L226 Difference]: Without dead ends: 58566 [2019-12-18 13:57:12,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:57:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58566 states. [2019-12-18 13:57:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58566 to 52262. [2019-12-18 13:57:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52262 states. [2019-12-18 13:57:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52262 states to 52262 states and 216300 transitions. [2019-12-18 13:57:14,351 INFO L78 Accepts]: Start accepts. Automaton has 52262 states and 216300 transitions. Word has length 15 [2019-12-18 13:57:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:14,352 INFO L462 AbstractCegarLoop]: Abstraction has 52262 states and 216300 transitions. [2019-12-18 13:57:14,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:57:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 52262 states and 216300 transitions. [2019-12-18 13:57:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 13:57:14,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:14,365 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-18 13:57:14,366 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-18 13:57:14,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:14,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1099673125, now seen corresponding path program 1 times [2019-12-18 13:57:14,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:14,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091868640] [2019-12-18 13:57:14,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:14,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091868640] [2019-12-18 13:57:14,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:14,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:57:14,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571590872] [2019-12-18 13:57:14,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:57:14,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:14,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:57:14,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:57:14,444 INFO L87 Difference]: Start difference. First operand 52262 states and 216300 transitions. Second operand 4 states. [2019-12-18 13:57:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:14,652 INFO L93 Difference]: Finished difference Result 41984 states and 159713 transitions. [2019-12-18 13:57:14,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:57:14,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 13:57:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:14,735 INFO L225 Difference]: With dead ends: 41984 [2019-12-18 13:57:14,735 INFO L226 Difference]: Without dead ends: 40876 [2019-12-18 13:57:14,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:57:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40876 states. [2019-12-18 13:57:15,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40876 to 40876. [2019-12-18 13:57:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40876 states. [2019-12-18 13:57:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40876 states to 40876 states and 156237 transitions. [2019-12-18 13:57:15,937 INFO L78 Accepts]: Start accepts. Automaton has 40876 states and 156237 transitions. Word has length 21 [2019-12-18 13:57:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:15,937 INFO L462 AbstractCegarLoop]: Abstraction has 40876 states and 156237 transitions. [2019-12-18 13:57:15,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:57:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 40876 states and 156237 transitions. [2019-12-18 13:57:18,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:57:18,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:18,095 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-18 13:57:18,095 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-18 13:57:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:18,096 INFO L82 PathProgramCache]: Analyzing trace with hash 637645513, now seen corresponding path program 1 times [2019-12-18 13:57:18,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:18,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896913911] [2019-12-18 13:57:18,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:18,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896913911] [2019-12-18 13:57:18,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:18,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:57:18,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152653349] [2019-12-18 13:57:18,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:57:18,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:18,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:57:18,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:57:18,198 INFO L87 Difference]: Start difference. First operand 40876 states and 156237 transitions. Second operand 5 states. [2019-12-18 13:57:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:18,916 INFO L93 Difference]: Finished difference Result 54396 states and 204140 transitions. [2019-12-18 13:57:18,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:57:18,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:57:18,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:19,050 INFO L225 Difference]: With dead ends: 54396 [2019-12-18 13:57:19,051 INFO L226 Difference]: Without dead ends: 54375 [2019-12-18 13:57:19,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:57:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54375 states. [2019-12-18 13:57:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54375 to 41122. [2019-12-18 13:57:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41122 states. [2019-12-18 13:57:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41122 states to 41122 states and 156869 transitions. [2019-12-18 13:57:20,218 INFO L78 Accepts]: Start accepts. Automaton has 41122 states and 156869 transitions. Word has length 22 [2019-12-18 13:57:20,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:20,219 INFO L462 AbstractCegarLoop]: Abstraction has 41122 states and 156869 transitions. [2019-12-18 13:57:20,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:57:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 41122 states and 156869 transitions. [2019-12-18 13:57:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 13:57:20,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:20,252 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-18 13:57:20,252 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-18 13:57:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2027557007, now seen corresponding path program 1 times [2019-12-18 13:57:20,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:20,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429249885] [2019-12-18 13:57:20,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:20,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429249885] [2019-12-18 13:57:20,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:20,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:57:20,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132949523] [2019-12-18 13:57:20,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:57:20,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:20,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:57:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:57:20,303 INFO L87 Difference]: Start difference. First operand 41122 states and 156869 transitions. Second operand 3 states. [2019-12-18 13:57:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:20,569 INFO L93 Difference]: Finished difference Result 51974 states and 196153 transitions. [2019-12-18 13:57:20,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:57:20,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-18 13:57:20,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:20,676 INFO L225 Difference]: With dead ends: 51974 [2019-12-18 13:57:20,676 INFO L226 Difference]: Without dead ends: 51974 [2019-12-18 13:57:20,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:57:20,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51974 states. [2019-12-18 13:57:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51974 to 45309. [2019-12-18 13:57:21,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45309 states. [2019-12-18 13:57:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45309 states to 45309 states and 172388 transitions. [2019-12-18 13:57:21,952 INFO L78 Accepts]: Start accepts. Automaton has 45309 states and 172388 transitions. Word has length 30 [2019-12-18 13:57:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:21,953 INFO L462 AbstractCegarLoop]: Abstraction has 45309 states and 172388 transitions. [2019-12-18 13:57:21,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:57:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 45309 states and 172388 transitions. [2019-12-18 13:57:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 13:57:21,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:21,979 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-18 13:57:21,979 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-18 13:57:21,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:21,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2027793723, now seen corresponding path program 1 times [2019-12-18 13:57:21,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:21,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640496095] [2019-12-18 13:57:21,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:22,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640496095] [2019-12-18 13:57:22,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:22,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:57:22,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615604778] [2019-12-18 13:57:22,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:57:22,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:22,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:57:22,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:57:22,060 INFO L87 Difference]: Start difference. First operand 45309 states and 172388 transitions. Second operand 5 states. [2019-12-18 13:57:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:22,162 INFO L93 Difference]: Finished difference Result 19765 states and 62245 transitions. [2019-12-18 13:57:22,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:57:22,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 13:57:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:22,190 INFO L225 Difference]: With dead ends: 19765 [2019-12-18 13:57:22,190 INFO L226 Difference]: Without dead ends: 18889 [2019-12-18 13:57:22,190 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-18 13:57:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18889 states. [2019-12-18 13:57:22,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18889 to 18889. [2019-12-18 13:57:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18889 states. [2019-12-18 13:57:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18889 states to 18889 states and 59447 transitions. [2019-12-18 13:57:22,749 INFO L78 Accepts]: Start accepts. Automaton has 18889 states and 59447 transitions. Word has length 30 [2019-12-18 13:57:22,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:22,750 INFO L462 AbstractCegarLoop]: Abstraction has 18889 states and 59447 transitions. [2019-12-18 13:57:22,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:57:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 18889 states and 59447 transitions. [2019-12-18 13:57:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 13:57:22,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:22,760 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-18 13:57:22,760 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-18 13:57:22,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1945851485, now seen corresponding path program 1 times [2019-12-18 13:57:22,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:22,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486483438] [2019-12-18 13:57:22,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:22,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486483438] [2019-12-18 13:57:22,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:22,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:57:22,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288127213] [2019-12-18 13:57:22,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:57:22,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:22,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:57:22,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:57:22,861 INFO L87 Difference]: Start difference. First operand 18889 states and 59447 transitions. Second operand 6 states. [2019-12-18 13:57:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:22,944 INFO L93 Difference]: Finished difference Result 3470 states and 8793 transitions. [2019-12-18 13:57:22,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:57:22,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-18 13:57:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:22,949 INFO L225 Difference]: With dead ends: 3470 [2019-12-18 13:57:22,949 INFO L226 Difference]: Without dead ends: 3101 [2019-12-18 13:57:22,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:57:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2019-12-18 13:57:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 3101. [2019-12-18 13:57:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3101 states. [2019-12-18 13:57:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 7755 transitions. [2019-12-18 13:57:22,988 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 7755 transitions. Word has length 31 [2019-12-18 13:57:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:22,988 INFO L462 AbstractCegarLoop]: Abstraction has 3101 states and 7755 transitions. [2019-12-18 13:57:22,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:57:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 7755 transitions. [2019-12-18 13:57:22,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 13:57:22,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:22,992 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-18 13:57:22,992 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-18 13:57:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:22,992 INFO L82 PathProgramCache]: Analyzing trace with hash -476238483, now seen corresponding path program 1 times [2019-12-18 13:57:22,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:22,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528002473] [2019-12-18 13:57:22,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:23,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528002473] [2019-12-18 13:57:23,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:23,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:57:23,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501167538] [2019-12-18 13:57:23,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:57:23,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:23,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:57:23,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:57:23,088 INFO L87 Difference]: Start difference. First operand 3101 states and 7755 transitions. Second operand 7 states. [2019-12-18 13:57:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:23,206 INFO L93 Difference]: Finished difference Result 1342 states and 3750 transitions. [2019-12-18 13:57:23,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:57:23,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-18 13:57:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:23,209 INFO L225 Difference]: With dead ends: 1342 [2019-12-18 13:57:23,209 INFO L226 Difference]: Without dead ends: 1293 [2019-12-18 13:57:23,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:57:23,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-12-18 13:57:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1181. [2019-12-18 13:57:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-12-18 13:57:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 3334 transitions. [2019-12-18 13:57:23,227 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 3334 transitions. Word has length 43 [2019-12-18 13:57:23,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:23,227 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 3334 transitions. [2019-12-18 13:57:23,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:57:23,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 3334 transitions. [2019-12-18 13:57:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:57:23,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:23,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:23,230 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-18 13:57:23,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:23,231 INFO L82 PathProgramCache]: Analyzing trace with hash -409088440, now seen corresponding path program 1 times [2019-12-18 13:57:23,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:23,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928710919] [2019-12-18 13:57:23,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:23,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928710919] [2019-12-18 13:57:23,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:23,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:57:23,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64760183] [2019-12-18 13:57:23,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:57:23,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:57:23,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:57:23,327 INFO L87 Difference]: Start difference. First operand 1181 states and 3334 transitions. Second operand 5 states. [2019-12-18 13:57:23,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:23,637 INFO L93 Difference]: Finished difference Result 1666 states and 4696 transitions. [2019-12-18 13:57:23,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:57:23,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 13:57:23,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:23,643 INFO L225 Difference]: With dead ends: 1666 [2019-12-18 13:57:23,643 INFO L226 Difference]: Without dead ends: 1666 [2019-12-18 13:57:23,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:57:23,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2019-12-18 13:57:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1470. [2019-12-18 13:57:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1470 states. [2019-12-18 13:57:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 4144 transitions. [2019-12-18 13:57:23,676 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 4144 transitions. Word has length 58 [2019-12-18 13:57:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:23,677 INFO L462 AbstractCegarLoop]: Abstraction has 1470 states and 4144 transitions. [2019-12-18 13:57:23,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:57:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 4144 transitions. [2019-12-18 13:57:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:57:23,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:23,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:23,682 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-18 13:57:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2087231872, now seen corresponding path program 2 times [2019-12-18 13:57:23,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:23,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868568696] [2019-12-18 13:57:23,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:23,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868568696] [2019-12-18 13:57:23,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:23,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:57:23,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232955666] [2019-12-18 13:57:23,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:57:23,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:23,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:57:23,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:57:23,814 INFO L87 Difference]: Start difference. First operand 1470 states and 4144 transitions. Second operand 6 states. [2019-12-18 13:57:24,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:24,124 INFO L93 Difference]: Finished difference Result 1745 states and 4788 transitions. [2019-12-18 13:57:24,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:57:24,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-18 13:57:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:24,128 INFO L225 Difference]: With dead ends: 1745 [2019-12-18 13:57:24,128 INFO L226 Difference]: Without dead ends: 1745 [2019-12-18 13:57:24,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:57:24,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2019-12-18 13:57:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1522. [2019-12-18 13:57:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2019-12-18 13:57:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 4220 transitions. [2019-12-18 13:57:24,156 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 4220 transitions. Word has length 58 [2019-12-18 13:57:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:24,156 INFO L462 AbstractCegarLoop]: Abstraction has 1522 states and 4220 transitions. [2019-12-18 13:57:24,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:57:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 4220 transitions. [2019-12-18 13:57:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:57:24,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:24,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:24,161 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-18 13:57:24,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash -893148506, now seen corresponding path program 3 times [2019-12-18 13:57:24,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:24,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873704042] [2019-12-18 13:57:24,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:24,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873704042] [2019-12-18 13:57:24,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:24,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:57:24,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185216702] [2019-12-18 13:57:24,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:57:24,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:24,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:57:24,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:57:24,278 INFO L87 Difference]: Start difference. First operand 1522 states and 4220 transitions. Second operand 3 states. [2019-12-18 13:57:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:24,294 INFO L93 Difference]: Finished difference Result 1414 states and 3884 transitions. [2019-12-18 13:57:24,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:57:24,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 13:57:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:24,297 INFO L225 Difference]: With dead ends: 1414 [2019-12-18 13:57:24,298 INFO L226 Difference]: Without dead ends: 1414 [2019-12-18 13:57:24,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:57:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-12-18 13:57:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2019-12-18 13:57:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-12-18 13:57:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 3884 transitions. [2019-12-18 13:57:24,320 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 3884 transitions. Word has length 58 [2019-12-18 13:57:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:24,320 INFO L462 AbstractCegarLoop]: Abstraction has 1414 states and 3884 transitions. [2019-12-18 13:57:24,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:57:24,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 3884 transitions. [2019-12-18 13:57:24,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 13:57:24,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:24,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:24,324 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-18 13:57:24,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:24,325 INFO L82 PathProgramCache]: Analyzing trace with hash -465324325, now seen corresponding path program 1 times [2019-12-18 13:57:24,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:24,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995101075] [2019-12-18 13:57:24,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:24,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:24,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995101075] [2019-12-18 13:57:24,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:24,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:57:24,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531873180] [2019-12-18 13:57:24,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:57:24,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:24,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:57:24,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:57:24,437 INFO L87 Difference]: Start difference. First operand 1414 states and 3884 transitions. Second operand 3 states. [2019-12-18 13:57:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:24,484 INFO L93 Difference]: Finished difference Result 1413 states and 3882 transitions. [2019-12-18 13:57:24,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:57:24,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 13:57:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:24,487 INFO L225 Difference]: With dead ends: 1413 [2019-12-18 13:57:24,487 INFO L226 Difference]: Without dead ends: 1413 [2019-12-18 13:57:24,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:57:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-12-18 13:57:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1160. [2019-12-18 13:57:24,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-12-18 13:57:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 3188 transitions. [2019-12-18 13:57:24,509 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 3188 transitions. Word has length 59 [2019-12-18 13:57:24,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:24,510 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 3188 transitions. [2019-12-18 13:57:24,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:57:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 3188 transitions. [2019-12-18 13:57:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:57:24,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:24,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:24,513 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-18 13:57:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1056994783, now seen corresponding path program 1 times [2019-12-18 13:57:24,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:24,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466049212] [2019-12-18 13:57:24,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:24,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-18 13:57:24,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466049212] [2019-12-18 13:57:24,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:24,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:57:24,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812457736] [2019-12-18 13:57:24,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:57:24,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:24,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:57:24,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:57:24,918 INFO L87 Difference]: Start difference. First operand 1160 states and 3188 transitions. Second operand 12 states. [2019-12-18 13:57:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:25,635 INFO L93 Difference]: Finished difference Result 2524 states and 6218 transitions. [2019-12-18 13:57:25,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:57:25,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-18 13:57:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:25,638 INFO L225 Difference]: With dead ends: 2524 [2019-12-18 13:57:25,638 INFO L226 Difference]: Without dead ends: 1480 [2019-12-18 13:57:25,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:57:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-12-18 13:57:25,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1020. [2019-12-18 13:57:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-12-18 13:57:25,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2717 transitions. [2019-12-18 13:57:25,660 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2717 transitions. Word has length 60 [2019-12-18 13:57:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:25,660 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 2717 transitions. [2019-12-18 13:57:25,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:57:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2717 transitions. [2019-12-18 13:57:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:57:25,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:25,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:25,663 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-18 13:57:25,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:25,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1968443931, now seen corresponding path program 2 times [2019-12-18 13:57:25,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:25,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300254855] [2019-12-18 13:57:25,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:25,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300254855] [2019-12-18 13:57:25,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:25,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 13:57:25,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556640855] [2019-12-18 13:57:25,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:57:25,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:25,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:57:25,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:57:25,930 INFO L87 Difference]: Start difference. First operand 1020 states and 2717 transitions. Second operand 13 states. [2019-12-18 13:57:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:26,651 INFO L93 Difference]: Finished difference Result 2575 states and 6195 transitions. [2019-12-18 13:57:26,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:57:26,651 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 13:57:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:26,652 INFO L225 Difference]: With dead ends: 2575 [2019-12-18 13:57:26,652 INFO L226 Difference]: Without dead ends: 796 [2019-12-18 13:57:26,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:57:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-18 13:57:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 571. [2019-12-18 13:57:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-18 13:57:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1223 transitions. [2019-12-18 13:57:26,660 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1223 transitions. Word has length 60 [2019-12-18 13:57:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:26,660 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 1223 transitions. [2019-12-18 13:57:26,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:57:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1223 transitions. [2019-12-18 13:57:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:57:26,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:26,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:26,661 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-18 13:57:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1222711449, now seen corresponding path program 3 times [2019-12-18 13:57:26,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:26,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504945533] [2019-12-18 13:57:26,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:26,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504945533] [2019-12-18 13:57:26,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:26,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:57:26,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005651640] [2019-12-18 13:57:26,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:57:26,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:26,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:57:26,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:57:26,782 INFO L87 Difference]: Start difference. First operand 571 states and 1223 transitions. Second operand 6 states. [2019-12-18 13:57:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:26,846 INFO L93 Difference]: Finished difference Result 809 states and 1670 transitions. [2019-12-18 13:57:26,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:57:26,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-18 13:57:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:26,847 INFO L225 Difference]: With dead ends: 809 [2019-12-18 13:57:26,847 INFO L226 Difference]: Without dead ends: 239 [2019-12-18 13:57:26,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:57:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-12-18 13:57:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2019-12-18 13:57:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-18 13:57:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 364 transitions. [2019-12-18 13:57:26,851 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 364 transitions. Word has length 60 [2019-12-18 13:57:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:26,851 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 364 transitions. [2019-12-18 13:57:26,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:57:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 364 transitions. [2019-12-18 13:57:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:57:26,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:26,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:26,853 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-18 13:57:26,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:26,853 INFO L82 PathProgramCache]: Analyzing trace with hash 424334393, now seen corresponding path program 4 times [2019-12-18 13:57:26,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:26,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640391448] [2019-12-18 13:57:26,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:57:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:57:27,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640391448] [2019-12-18 13:57:27,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:57:27,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:57:27,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478166978] [2019-12-18 13:57:27,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:57:27,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:57:27,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:57:27,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:57:27,090 INFO L87 Difference]: Start difference. First operand 215 states and 364 transitions. Second operand 13 states. [2019-12-18 13:57:27,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:57:27,485 INFO L93 Difference]: Finished difference Result 366 states and 609 transitions. [2019-12-18 13:57:27,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 13:57:27,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 13:57:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:57:27,487 INFO L225 Difference]: With dead ends: 366 [2019-12-18 13:57:27,487 INFO L226 Difference]: Without dead ends: 333 [2019-12-18 13:57:27,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:57:27,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-18 13:57:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 323. [2019-12-18 13:57:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-18 13:57:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 549 transitions. [2019-12-18 13:57:27,492 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 549 transitions. Word has length 60 [2019-12-18 13:57:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:57:27,492 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 549 transitions. [2019-12-18 13:57:27,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:57:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 549 transitions. [2019-12-18 13:57:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 13:57:27,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:57:27,493 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:57:27,493 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-18 13:57:27,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:57:27,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1750352957, now seen corresponding path program 5 times [2019-12-18 13:57:27,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:57:27,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081282364] [2019-12-18 13:57:27,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:57:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:57:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:57:27,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:57:27,602 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:57:27,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] ULTIMATE.startENTRY-->L823: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~z$w_buff0~0_106 0) (= v_~z$r_buff0_thd2~0_89 0) (= v_~main$tmp_guard0~0_30 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd1~0_90) (< 0 |v_#StackHeapBarrier_21|) (= v_~a~0_108 0) (= v_~z$w_buff0_used~0_517 0) (= v_~z$r_buff0_thd0~0_321 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1469~0.base_22|) 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_244 0) (= 0 v_~z$w_buff1~0_99) (= 0 |v_#NULL.base_6|) (= 0 v_~z$r_buff1_thd2~0_90) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$flush_delayed~0_47) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$r_buff0_thd3~0_147) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1469~0.base_22| 4)) (= 0 v_~z$r_buff1_thd4~0_142) (= 0 v_~z$r_buff1_thd3~0_154) (= 0 v_~weak$$choice0~0_24) (= 0 |v_ULTIMATE.start_main_~#t1469~0.offset_17|) (= v_~__unbuffered_cnt~0_141 0) (= v_~z$w_buff1_used~0_308 0) (= 0 v_~__unbuffered_p3_EAX~0_99) (= v_~weak$$choice2~0_108 0) (= v_~z$r_buff0_thd1~0_89 0) (= 0 v_~z$r_buff0_thd4~0_241) (= v_~z~0_160 0) (= v_~z$mem_tmp~0_28 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1469~0.base_22|) (= v_~y~0_41 0) (= v_~x~0_54 0) (= |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|) (= v_~main$tmp_guard1~0_22 0))) 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_33|, 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_90, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_55|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_38|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_30|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_19|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|, ~a~0=v_~a~0_108, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_321, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_241, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_99, #length=|v_#length_31|, ~z$mem_tmp~0=v_~z$mem_tmp~0_28, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_96|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_308, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_30|, ULTIMATE.start_main_~#t1471~0.base=|v_ULTIMATE.start_main_~#t1471~0.base_20|, ~z$flush_delayed~0=v_~z$flush_delayed~0_47, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_33|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_32|, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_141|, 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_90, 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_147, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_54, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_142, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_99, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_29|, ~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_105|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_33|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_244, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_41|, ~y~0=v_~y~0_41, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_89, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_517, ~z$w_buff0~0=v_~z$w_buff0~0_106, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_33|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_41|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_154, 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_31|, 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_91|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_30|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_27|, 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_20|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_89} 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-18 13:57:27,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] 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-18 13:57:27,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] 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-18 13:57:27,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] 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-18 13:57:27,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L4-->L800: Formula: (and (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1349661859)) (= ~z$r_buff0_thd1~0_In1349661859 ~z$r_buff1_thd1~0_Out1349661859) (= 1 ~z$r_buff0_thd4~0_Out1349661859) (= ~z$r_buff1_thd3~0_Out1349661859 ~z$r_buff0_thd3~0_In1349661859) (= ~z$r_buff0_thd4~0_In1349661859 ~z$r_buff1_thd4~0_Out1349661859) (= ~z$r_buff1_thd0~0_Out1349661859 ~z$r_buff0_thd0~0_In1349661859) (= ~z$r_buff0_thd2~0_In1349661859 ~z$r_buff1_thd2~0_Out1349661859) (= ~__unbuffered_p3_EAX~0_Out1349661859 ~a~0_In1349661859)) InVars {~a~0=~a~0_In1349661859, P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1349661859, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1349661859, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1349661859, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1349661859, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1349661859, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1349661859} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1349661859, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1349661859, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1349661859, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1349661859, ~a~0=~a~0_In1349661859, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1349661859, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1349661859, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1349661859, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1349661859, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1349661859, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1349661859, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1349661859, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1349661859} 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-18 13:57:27,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_P0Thread1of1ForFork0_~arg.base_19 |v_P0Thread1of1ForFork0_#in~arg.base_19|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_~x~0_32 1) (= v_~a~0_41 1) (= v_P0Thread1of1ForFork0_~arg.offset_19 |v_P0Thread1of1ForFork0_#in~arg.offset_19|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_41, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_19|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_19|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_19, ~x~0=v_~x~0_32, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_19} 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-18 13:57:27,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_23) (= |v_P1Thread1of1ForFork1_#res.offset_11| 0) (= v_P1Thread1of1ForFork1_~arg.base_19 |v_P1Thread1of1ForFork1_#in~arg.base_19|) (= 0 |v_P1Thread1of1ForFork1_#res.base_11|) (= v_~x~0_41 2) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_19| v_P1Thread1of1ForFork1_~arg.offset_19)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_19, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_11|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_19|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, ~y~0=v_~y~0_32, ~x~0=v_~x~0_41, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_11|} 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-18 13:57:27,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In614220836 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In614220836 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out614220836| ~z$w_buff0_used~0_In614220836) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out614220836| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In614220836, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In614220836} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In614220836, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In614220836, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out614220836|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 13:57:27,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L770-2-->L770-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-1164874646 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1164874646 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1164874646 |P2Thread1of1ForFork2_#t~ite3_Out-1164874646|)) (and (= ~z~0_In-1164874646 |P2Thread1of1ForFork2_#t~ite3_Out-1164874646|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1164874646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164874646, ~z$w_buff1~0=~z$w_buff1~0_In-1164874646, ~z~0=~z~0_In-1164874646} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1164874646|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1164874646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164874646, ~z$w_buff1~0=~z$w_buff1~0_In-1164874646, ~z~0=~z~0_In-1164874646} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 13:57:27,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L770-4-->L771: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_14| v_~z~0_35) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_14|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_13|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_13|, ~z~0=v_~z~0_35} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 13:57:27,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1431489906 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1431489906 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1431489906 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1431489906 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite12_Out-1431489906| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1431489906 |P3Thread1of1ForFork3_#t~ite12_Out-1431489906|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1431489906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431489906, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1431489906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431489906} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1431489906, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1431489906, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1431489906, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1431489906, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-1431489906|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 13:57:27,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L803-->L804: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In301213919 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In301213919 256)))) (or (and (= 0 ~z$r_buff0_thd4~0_Out301213919) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_In301213919 ~z$r_buff0_thd4~0_Out301213919) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In301213919, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In301213919} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In301213919, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out301213919, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out301213919|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 13:57:27,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-23942351 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-23942351 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-23942351 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-23942351 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out-23942351|)) (and (= |P3Thread1of1ForFork3_#t~ite14_Out-23942351| ~z$r_buff1_thd4~0_In-23942351) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-23942351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-23942351, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-23942351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-23942351} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-23942351, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-23942351, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-23942351|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-23942351, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-23942351} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 13:57:27,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L804-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_84)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_84, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, 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-18 13:57:27,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1066015542 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1066015542 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1066015542 |P2Thread1of1ForFork2_#t~ite5_Out-1066015542|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1066015542|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1066015542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1066015542} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1066015542|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1066015542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1066015542} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 13:57:27,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-190322246 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-190322246 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-190322246 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-190322246 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-190322246|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-190322246 |P2Thread1of1ForFork2_#t~ite6_Out-190322246|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-190322246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-190322246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-190322246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-190322246} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-190322246|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-190322246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-190322246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-190322246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-190322246} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 13:57:27,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1899209518 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1899209518 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1899209518| ~z$r_buff0_thd3~0_In1899209518)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out1899209518| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1899209518, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1899209518} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1899209518, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1899209518, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1899209518|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 13:57:27,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L774-->L774-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In2142317179 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In2142317179 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In2142317179 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In2142317179 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out2142317179|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In2142317179 |P2Thread1of1ForFork2_#t~ite8_Out2142317179|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2142317179, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2142317179, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142317179, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2142317179} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2142317179, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2142317179, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2142317179, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2142317179, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out2142317179|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 13:57:27,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_126) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_126, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} 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-18 13:57:27,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L833-->L835-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_104 256)) (= (mod v_~z$r_buff0_thd0~0_62 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_62, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:57:27,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1080820641 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1080820641 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1080820641 |ULTIMATE.start_main_#t~ite19_Out-1080820641|) (not .cse1)) (and (= ~z~0_In-1080820641 |ULTIMATE.start_main_#t~ite19_Out-1080820641|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1080820641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1080820641, ~z$w_buff1~0=~z$w_buff1~0_In-1080820641, ~z~0=~z~0_In-1080820641} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1080820641|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1080820641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1080820641, ~z$w_buff1~0=~z$w_buff1~0_In-1080820641, ~z~0=~z~0_In-1080820641} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:57:27,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L835-4-->L836: Formula: (= v_~z~0_32 |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_32, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:57:27,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1632644994 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1632644994 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1632644994 |ULTIMATE.start_main_#t~ite21_Out-1632644994|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1632644994|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1632644994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1632644994} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1632644994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1632644994, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1632644994|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:57:27,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L837-->L837-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1969752898 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1969752898 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1969752898 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1969752898 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1969752898 |ULTIMATE.start_main_#t~ite22_Out1969752898|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1969752898|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1969752898, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1969752898, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1969752898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1969752898} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1969752898, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1969752898, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1969752898, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1969752898, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1969752898|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:57:27,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In182919776 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In182919776 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out182919776|)) (and (= ~z$r_buff0_thd0~0_In182919776 |ULTIMATE.start_main_#t~ite23_Out182919776|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In182919776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In182919776} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In182919776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In182919776, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out182919776|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 13:57:27,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1142421039 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1142421039 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1142421039 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1142421039 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite24_Out-1142421039|)) (and (= ~z$r_buff1_thd0~0_In-1142421039 |ULTIMATE.start_main_#t~ite24_Out-1142421039|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1142421039, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1142421039, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1142421039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1142421039} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1142421039, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1142421039, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1142421039, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1142421039|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1142421039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 13:57:27,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L848-->L848-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1708200299 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite33_In1708200299| |ULTIMATE.start_main_#t~ite33_Out1708200299|) (= |ULTIMATE.start_main_#t~ite34_Out1708200299| ~z$w_buff1~0_In1708200299)) (and .cse0 (= |ULTIMATE.start_main_#t~ite33_Out1708200299| ~z$w_buff1~0_In1708200299) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1708200299 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1708200299 256) 0)) (= (mod ~z$w_buff0_used~0_In1708200299 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1708200299 256))))) (= |ULTIMATE.start_main_#t~ite33_Out1708200299| |ULTIMATE.start_main_#t~ite34_Out1708200299|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1708200299, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1708200299, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1708200299, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708200299, ~z$w_buff1~0=~z$w_buff1~0_In1708200299, ~weak$$choice2~0=~weak$$choice2~0_In1708200299, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In1708200299|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1708200299, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1708200299, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1708200299, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1708200299, ~z$w_buff1~0=~z$w_buff1~0_In1708200299, ~weak$$choice2~0=~weak$$choice2~0_In1708200299, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1708200299|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1708200299|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 13:57:27,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L850-->L850-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1894858241 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1894858241| ~z$w_buff1_used~0_In-1894858241) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1894858241 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-1894858241 256)) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1894858241 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In-1894858241 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out-1894858241| |ULTIMATE.start_main_#t~ite40_Out-1894858241|)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1894858241| ~z$w_buff1_used~0_In-1894858241) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_In-1894858241| |ULTIMATE.start_main_#t~ite39_Out-1894858241|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1894858241, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1894858241, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1894858241|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1894858241, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1894858241, ~weak$$choice2~0=~weak$$choice2~0_In-1894858241} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1894858241, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1894858241|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1894858241|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1894858241, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1894858241, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1894858241, ~weak$$choice2~0=~weak$$choice2~0_In-1894858241} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:57:27,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L851-->L852: Formula: (and (= v_~z$r_buff0_thd0~0_135 v_~z$r_buff0_thd0~0_134) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_41, 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-18 13:57:27,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L852-->L852-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1853108215 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1853108215| ~z$r_buff1_thd0~0_In1853108215) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In1853108215| |ULTIMATE.start_main_#t~ite45_Out1853108215|)) (and (= |ULTIMATE.start_main_#t~ite45_Out1853108215| |ULTIMATE.start_main_#t~ite46_Out1853108215|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1853108215 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1853108215 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1853108215 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1853108215 256))))) (= |ULTIMATE.start_main_#t~ite45_Out1853108215| ~z$r_buff1_thd0~0_In1853108215)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1853108215, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1853108215, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1853108215, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1853108215, ~weak$$choice2~0=~weak$$choice2~0_In1853108215, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1853108215|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1853108215, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1853108215, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1853108215, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1853108215, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1853108215|, ~weak$$choice2~0=~weak$$choice2~0_In1853108215, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1853108215|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:57:27,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L854-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_38) (not (= (mod v_~z$flush_delayed~0_39 256) 0)) (= v_~z$mem_tmp~0_25 v_~z~0_127) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_12 256))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_39} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_25, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_38, ~z~0=v_~z~0_127, 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-18 13:57:27,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] 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-18 13:57:27,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:57:27 BasicIcfg [2019-12-18 13:57:27,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:57:27,726 INFO L168 Benchmark]: Toolchain (without parser) took 35926.15 ms. Allocated memory was 143.7 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 100.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 683.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:57:27,726 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 13:57:27,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.76 ms. Allocated memory was 143.7 MB in the beginning and 202.9 MB in the end (delta: 59.2 MB). Free memory was 99.5 MB in the beginning and 155.0 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:57:27,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.12 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:57:27,733 INFO L168 Benchmark]: Boogie Preprocessor took 37.60 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:57:27,734 INFO L168 Benchmark]: RCFGBuilder took 853.97 ms. Allocated memory is still 202.9 MB. Free memory was 149.7 MB in the beginning and 100.4 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:57:27,734 INFO L168 Benchmark]: TraceAbstraction took 34174.80 ms. Allocated memory was 202.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 100.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 624.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:57:27,741 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.49 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 790.76 ms. Allocated memory was 143.7 MB in the beginning and 202.9 MB in the end (delta: 59.2 MB). Free memory was 99.5 MB in the beginning and 155.0 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.12 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.60 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 149.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 853.97 ms. Allocated memory is still 202.9 MB. Free memory was 149.7 MB in the beginning and 100.4 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34174.80 ms. Allocated memory was 202.9 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 100.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 624.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 179 ProgramPointsBefore, 91 ProgramPointsAfterwards, 207 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 27 ChoiceCompositions, 4846 VarBasedMoverChecksPositive, 179 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 208 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 50860 CheckedPairsTotal, 120 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: 33.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2040 SDtfs, 2796 SDslu, 5264 SDs, 0 SdLazy, 2338 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52262occurred 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: 11.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 32501 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 749 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 672 ConstructedInterpolants, 0 QuantifiedInterpolants, 134616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...