/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/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:05:28,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:05:28,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:05:28,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:05:28,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:05:28,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:05:28,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:05:28,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:05:28,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:05:28,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:05:28,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:05:28,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:05:28,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:05:28,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:05:28,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:05:28,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:05:28,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:05:28,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:05:28,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:05:28,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:05:28,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:05:28,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:05:28,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:05:28,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:05:28,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:05:28,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:05:28,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:05:28,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:05:28,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:05:28,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:05:28,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:05:28,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:05:28,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:05:28,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:05:28,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:05:28,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:05:28,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:05:28,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:05:28,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:05:28,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:05:28,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:05:28,628 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-26 23:05:28,641 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:05:28,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:05:28,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:05:28,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:05:28,643 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:05:28,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:05:28,644 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:05:28,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:05:28,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:05:28,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:05:28,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:05:28,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:05:28,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:05:28,645 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:05:28,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:05:28,645 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:05:28,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:05:28,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:05:28,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:05:28,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:05:28,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:05:28,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:05:28,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:05:28,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:05:28,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:05:28,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:05:28,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:05:28,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:05:28,648 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:05:28,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:05:28,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:05:28,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:05:28,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:05:28,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:05:28,965 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:05:28,966 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2019-12-26 23:05:29,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3086090/da4e12eab48644e5afb33b9fdccb17ff/FLAGddddc9703 [2019-12-26 23:05:29,585 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:05:29,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2019-12-26 23:05:29,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3086090/da4e12eab48644e5afb33b9fdccb17ff/FLAGddddc9703 [2019-12-26 23:05:29,902 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3086090/da4e12eab48644e5afb33b9fdccb17ff [2019-12-26 23:05:29,910 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:05:29,912 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:05:29,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:05:29,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:05:29,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:05:29,916 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:05:29" (1/1) ... [2019-12-26 23:05:29,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1511a0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:29, skipping insertion in model container [2019-12-26 23:05:29,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:05:29" (1/1) ... [2019-12-26 23:05:29,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:05:29,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:05:30,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:05:30,553 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:05:30,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:05:30,701 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:05:30,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30 WrapperNode [2019-12-26 23:05:30,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:05:30,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:05:30,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:05:30,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:05:30,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30" (1/1) ... [2019-12-26 23:05:30,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30" (1/1) ... [2019-12-26 23:05:30,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:05:30,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:05:30,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:05:30,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:05:30,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30" (1/1) ... [2019-12-26 23:05:30,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30" (1/1) ... [2019-12-26 23:05:30,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30" (1/1) ... [2019-12-26 23:05:30,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30" (1/1) ... [2019-12-26 23:05:30,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30" (1/1) ... [2019-12-26 23:05:30,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30" (1/1) ... [2019-12-26 23:05:30,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30" (1/1) ... [2019-12-26 23:05:30,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:05:30,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:05:30,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:05:30,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:05:30,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30" (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-26 23:05:30,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:05:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:05:30,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:05:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:05:30,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:05:30,872 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:05:30,872 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:05:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 23:05:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 23:05:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:05:30,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:05:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:05:30,875 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:05:31,614 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:05:31,615 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:05:31,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:05:31 BoogieIcfgContainer [2019-12-26 23:05:31,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:05:31,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:05:31,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:05:31,622 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:05:31,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:05:29" (1/3) ... [2019-12-26 23:05:31,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f791d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:05:31, skipping insertion in model container [2019-12-26 23:05:31,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:05:30" (2/3) ... [2019-12-26 23:05:31,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f791d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:05:31, skipping insertion in model container [2019-12-26 23:05:31,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:05:31" (3/3) ... [2019-12-26 23:05:31,626 INFO L109 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2019-12-26 23:05:31,636 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:05:31,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:05:31,644 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:05:31,645 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:05:31,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,684 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,688 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,688 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,696 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,696 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,696 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,696 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,696 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,697 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,697 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,697 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,698 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,698 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,698 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,698 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,699 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,699 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,699 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,700 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,700 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,700 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,700 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,720 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,721 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,721 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,729 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,730 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,734 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,734 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,735 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,736 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,736 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,736 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,739 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:05:31,751 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 23:05:31,766 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:05:31,766 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:05:31,766 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:05:31,767 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:05:31,767 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:05:31,767 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:05:31,767 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:05:31,767 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:05:31,790 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 206 transitions [2019-12-26 23:05:31,792 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-26 23:05:31,906 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-26 23:05:31,906 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:05:31,924 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 23:05:31,941 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 206 transitions [2019-12-26 23:05:32,036 INFO L132 PetriNetUnfolder]: 41/202 cut-off events. [2019-12-26 23:05:32,036 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:05:32,046 INFO L76 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 41/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 275 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 23:05:32,065 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 23:05:32,066 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:05:36,903 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-26 23:05:37,152 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-26 23:05:37,277 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-26 23:05:37,298 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56276 [2019-12-26 23:05:37,298 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-26 23:05:37,302 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 100 transitions [2019-12-26 23:05:39,348 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32878 states. [2019-12-26 23:05:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 32878 states. [2019-12-26 23:05:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 23:05:39,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:39,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:39,359 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash -667351009, now seen corresponding path program 1 times [2019-12-26 23:05:39,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:39,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834555963] [2019-12-26 23:05:39,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:39,736 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-26 23:05:39,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834555963] [2019-12-26 23:05:39,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:39,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:05:39,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341001305] [2019-12-26 23:05:39,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:05:39,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:39,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:05:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:39,764 INFO L87 Difference]: Start difference. First operand 32878 states. Second operand 3 states. [2019-12-26 23:05:40,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:40,914 INFO L93 Difference]: Finished difference Result 32686 states and 139960 transitions. [2019-12-26 23:05:40,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:05:40,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 23:05:40,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:41,292 INFO L225 Difference]: With dead ends: 32686 [2019-12-26 23:05:41,293 INFO L226 Difference]: Without dead ends: 32062 [2019-12-26 23:05:41,295 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-26 23:05:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32062 states. [2019-12-26 23:05:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32062 to 32062. [2019-12-26 23:05:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32062 states. [2019-12-26 23:05:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32062 states to 32062 states and 137412 transitions. [2019-12-26 23:05:44,048 INFO L78 Accepts]: Start accepts. Automaton has 32062 states and 137412 transitions. Word has length 9 [2019-12-26 23:05:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:44,049 INFO L462 AbstractCegarLoop]: Abstraction has 32062 states and 137412 transitions. [2019-12-26 23:05:44,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:05:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 32062 states and 137412 transitions. [2019-12-26 23:05:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 23:05:44,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:44,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:44,058 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:44,059 INFO L82 PathProgramCache]: Analyzing trace with hash -139405083, now seen corresponding path program 1 times [2019-12-26 23:05:44,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:44,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096403293] [2019-12-26 23:05:44,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:44,143 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-26 23:05:44,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096403293] [2019-12-26 23:05:44,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:44,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:05:44,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400182929] [2019-12-26 23:05:44,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:05:44,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:44,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:05:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:05:44,148 INFO L87 Difference]: Start difference. First operand 32062 states and 137412 transitions. Second operand 4 states. [2019-12-26 23:05:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:45,055 INFO L93 Difference]: Finished difference Result 51166 states and 211740 transitions. [2019-12-26 23:05:45,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:05:45,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 23:05:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:45,417 INFO L225 Difference]: With dead ends: 51166 [2019-12-26 23:05:45,417 INFO L226 Difference]: Without dead ends: 51138 [2019-12-26 23:05:45,418 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-26 23:05:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51138 states. [2019-12-26 23:05:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51138 to 46670. [2019-12-26 23:05:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46670 states. [2019-12-26 23:05:47,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46670 states to 46670 states and 195108 transitions. [2019-12-26 23:05:47,311 INFO L78 Accepts]: Start accepts. Automaton has 46670 states and 195108 transitions. Word has length 15 [2019-12-26 23:05:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:47,311 INFO L462 AbstractCegarLoop]: Abstraction has 46670 states and 195108 transitions. [2019-12-26 23:05:47,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:05:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 46670 states and 195108 transitions. [2019-12-26 23:05:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 23:05:47,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:47,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:47,315 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:47,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2113277815, now seen corresponding path program 1 times [2019-12-26 23:05:47,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:47,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920885332] [2019-12-26 23:05:47,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:47,377 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-26 23:05:47,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920885332] [2019-12-26 23:05:47,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:47,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:05:47,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474533591] [2019-12-26 23:05:47,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:05:47,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:47,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:05:47,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:47,379 INFO L87 Difference]: Start difference. First operand 46670 states and 195108 transitions. Second operand 3 states. [2019-12-26 23:05:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:49,176 INFO L93 Difference]: Finished difference Result 36669 states and 141744 transitions. [2019-12-26 23:05:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:05:49,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 23:05:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:49,269 INFO L225 Difference]: With dead ends: 36669 [2019-12-26 23:05:49,270 INFO L226 Difference]: Without dead ends: 36669 [2019-12-26 23:05:49,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36669 states. [2019-12-26 23:05:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36669 to 36669. [2019-12-26 23:05:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36669 states. [2019-12-26 23:05:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36669 states to 36669 states and 141744 transitions. [2019-12-26 23:05:50,364 INFO L78 Accepts]: Start accepts. Automaton has 36669 states and 141744 transitions. Word has length 15 [2019-12-26 23:05:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:50,365 INFO L462 AbstractCegarLoop]: Abstraction has 36669 states and 141744 transitions. [2019-12-26 23:05:50,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:05:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 36669 states and 141744 transitions. [2019-12-26 23:05:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:05:50,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:50,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:50,368 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash -456655226, now seen corresponding path program 1 times [2019-12-26 23:05:50,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:50,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970387205] [2019-12-26 23:05:50,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:50,425 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-26 23:05:50,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970387205] [2019-12-26 23:05:50,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:50,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:05:50,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948865581] [2019-12-26 23:05:50,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:05:50,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:50,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:05:50,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:05:50,428 INFO L87 Difference]: Start difference. First operand 36669 states and 141744 transitions. Second operand 4 states. [2019-12-26 23:05:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:50,505 INFO L93 Difference]: Finished difference Result 15339 states and 49236 transitions. [2019-12-26 23:05:50,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:05:50,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 23:05:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:50,535 INFO L225 Difference]: With dead ends: 15339 [2019-12-26 23:05:50,535 INFO L226 Difference]: Without dead ends: 15339 [2019-12-26 23:05:50,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:05:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15339 states. [2019-12-26 23:05:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15339 to 15339. [2019-12-26 23:05:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15339 states. [2019-12-26 23:05:51,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 49236 transitions. [2019-12-26 23:05:51,319 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 49236 transitions. Word has length 16 [2019-12-26 23:05:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:51,320 INFO L462 AbstractCegarLoop]: Abstraction has 15339 states and 49236 transitions. [2019-12-26 23:05:51,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:05:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 49236 transitions. [2019-12-26 23:05:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:05:51,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:51,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:51,323 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:51,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:51,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1764835742, now seen corresponding path program 1 times [2019-12-26 23:05:51,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:51,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896136497] [2019-12-26 23:05:51,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:51,424 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-26 23:05:51,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896136497] [2019-12-26 23:05:51,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:51,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:05:51,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853023607] [2019-12-26 23:05:51,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:05:51,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:51,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:05:51,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:05:51,426 INFO L87 Difference]: Start difference. First operand 15339 states and 49236 transitions. Second operand 5 states. [2019-12-26 23:05:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:51,464 INFO L93 Difference]: Finished difference Result 2638 states and 6819 transitions. [2019-12-26 23:05:51,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:05:51,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 23:05:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:51,469 INFO L225 Difference]: With dead ends: 2638 [2019-12-26 23:05:51,470 INFO L226 Difference]: Without dead ends: 2638 [2019-12-26 23:05:51,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:05:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2019-12-26 23:05:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2638. [2019-12-26 23:05:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2019-12-26 23:05:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 6819 transitions. [2019-12-26 23:05:51,517 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 6819 transitions. Word has length 17 [2019-12-26 23:05:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:51,517 INFO L462 AbstractCegarLoop]: Abstraction has 2638 states and 6819 transitions. [2019-12-26 23:05:51,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:05:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 6819 transitions. [2019-12-26 23:05:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:05:51,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:51,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:05:51,522 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:51,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1144833891, now seen corresponding path program 1 times [2019-12-26 23:05:51,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:51,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562480694] [2019-12-26 23:05:51,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:51,601 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-26 23:05:51,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562480694] [2019-12-26 23:05:51,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:51,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:05:51,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679703679] [2019-12-26 23:05:51,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:05:51,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:51,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:05:51,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:05:51,605 INFO L87 Difference]: Start difference. First operand 2638 states and 6819 transitions. Second operand 6 states. [2019-12-26 23:05:51,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:51,657 INFO L93 Difference]: Finished difference Result 1222 states and 3487 transitions. [2019-12-26 23:05:51,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:05:51,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 23:05:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:51,660 INFO L225 Difference]: With dead ends: 1222 [2019-12-26 23:05:51,660 INFO L226 Difference]: Without dead ends: 1222 [2019-12-26 23:05:51,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:05:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-26 23:05:51,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1110. [2019-12-26 23:05:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2019-12-26 23:05:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3167 transitions. [2019-12-26 23:05:51,679 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3167 transitions. Word has length 29 [2019-12-26 23:05:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:51,680 INFO L462 AbstractCegarLoop]: Abstraction has 1110 states and 3167 transitions. [2019-12-26 23:05:51,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:05:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3167 transitions. [2019-12-26 23:05:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:05:51,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:51,685 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-26 23:05:51,685 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:51,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:51,688 INFO L82 PathProgramCache]: Analyzing trace with hash -275883304, now seen corresponding path program 1 times [2019-12-26 23:05:51,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:51,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633131002] [2019-12-26 23:05:51,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:05:51,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633131002] [2019-12-26 23:05:51,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:51,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:05:51,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98721909] [2019-12-26 23:05:51,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:05:51,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:51,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:05:51,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:51,857 INFO L87 Difference]: Start difference. First operand 1110 states and 3167 transitions. Second operand 3 states. [2019-12-26 23:05:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:51,919 INFO L93 Difference]: Finished difference Result 1120 states and 3182 transitions. [2019-12-26 23:05:51,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:05:51,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 23:05:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:51,922 INFO L225 Difference]: With dead ends: 1120 [2019-12-26 23:05:51,922 INFO L226 Difference]: Without dead ends: 1120 [2019-12-26 23:05:51,923 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-26 23:05:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-26 23:05:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1114. [2019-12-26 23:05:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-12-26 23:05:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 3175 transitions. [2019-12-26 23:05:51,942 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 3175 transitions. Word has length 58 [2019-12-26 23:05:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:51,945 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 3175 transitions. [2019-12-26 23:05:51,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:05:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 3175 transitions. [2019-12-26 23:05:51,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:05:51,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:51,949 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-26 23:05:51,949 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:51,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:51,949 INFO L82 PathProgramCache]: Analyzing trace with hash -791070951, now seen corresponding path program 1 times [2019-12-26 23:05:51,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:51,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080886418] [2019-12-26 23:05:51,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:52,100 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-26 23:05:52,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080886418] [2019-12-26 23:05:52,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:52,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:05:52,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505891056] [2019-12-26 23:05:52,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:05:52,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:52,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:05:52,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:05:52,103 INFO L87 Difference]: Start difference. First operand 1114 states and 3175 transitions. Second operand 5 states. [2019-12-26 23:05:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:52,361 INFO L93 Difference]: Finished difference Result 1623 states and 4613 transitions. [2019-12-26 23:05:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:05:52,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 23:05:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:52,365 INFO L225 Difference]: With dead ends: 1623 [2019-12-26 23:05:52,366 INFO L226 Difference]: Without dead ends: 1623 [2019-12-26 23:05:52,366 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-26 23:05:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2019-12-26 23:05:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1210. [2019-12-26 23:05:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-12-26 23:05:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3463 transitions. [2019-12-26 23:05:52,389 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3463 transitions. Word has length 58 [2019-12-26 23:05:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:52,389 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 3463 transitions. [2019-12-26 23:05:52,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:05:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3463 transitions. [2019-12-26 23:05:52,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:05:52,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:52,393 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-26 23:05:52,394 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:52,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:52,394 INFO L82 PathProgramCache]: Analyzing trace with hash 867176459, now seen corresponding path program 2 times [2019-12-26 23:05:52,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:52,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417111262] [2019-12-26 23:05:52,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:52,514 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-26 23:05:52,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417111262] [2019-12-26 23:05:52,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:52,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:05:52,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936529429] [2019-12-26 23:05:52,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:05:52,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:52,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:05:52,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:05:52,516 INFO L87 Difference]: Start difference. First operand 1210 states and 3463 transitions. Second operand 6 states. [2019-12-26 23:05:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:52,900 INFO L93 Difference]: Finished difference Result 1488 states and 4124 transitions. [2019-12-26 23:05:52,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:05:52,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-26 23:05:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:52,903 INFO L225 Difference]: With dead ends: 1488 [2019-12-26 23:05:52,903 INFO L226 Difference]: Without dead ends: 1488 [2019-12-26 23:05:52,904 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-26 23:05:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-26 23:05:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1266. [2019-12-26 23:05:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2019-12-26 23:05:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 3555 transitions. [2019-12-26 23:05:52,922 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 3555 transitions. Word has length 58 [2019-12-26 23:05:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:52,922 INFO L462 AbstractCegarLoop]: Abstraction has 1266 states and 3555 transitions. [2019-12-26 23:05:52,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:05:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 3555 transitions. [2019-12-26 23:05:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:05:52,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:52,926 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-26 23:05:52,926 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:52,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:52,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2105802411, now seen corresponding path program 3 times [2019-12-26 23:05:52,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:52,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97180454] [2019-12-26 23:05:52,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:53,001 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-26 23:05:53,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97180454] [2019-12-26 23:05:53,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:53,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:05:53,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344929662] [2019-12-26 23:05:53,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:05:53,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:53,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:05:53,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:53,003 INFO L87 Difference]: Start difference. First operand 1266 states and 3555 transitions. Second operand 3 states. [2019-12-26 23:05:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:53,050 INFO L93 Difference]: Finished difference Result 1265 states and 3553 transitions. [2019-12-26 23:05:53,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:05:53,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 23:05:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:53,053 INFO L225 Difference]: With dead ends: 1265 [2019-12-26 23:05:53,054 INFO L226 Difference]: Without dead ends: 1265 [2019-12-26 23:05:53,054 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-26 23:05:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-12-26 23:05:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 952. [2019-12-26 23:05:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-26 23:05:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2683 transitions. [2019-12-26 23:05:53,071 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2683 transitions. Word has length 58 [2019-12-26 23:05:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:53,072 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 2683 transitions. [2019-12-26 23:05:53,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:05:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2683 transitions. [2019-12-26 23:05:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 23:05:53,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:53,075 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-26 23:05:53,075 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:53,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:53,075 INFO L82 PathProgramCache]: Analyzing trace with hash 654382096, now seen corresponding path program 1 times [2019-12-26 23:05:53,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:53,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601317932] [2019-12-26 23:05:53,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:53,204 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-26 23:05:53,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601317932] [2019-12-26 23:05:53,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:53,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:05:53,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852488249] [2019-12-26 23:05:53,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:05:53,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:53,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:05:53,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:05:53,207 INFO L87 Difference]: Start difference. First operand 952 states and 2683 transitions. Second operand 3 states. [2019-12-26 23:05:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:53,225 INFO L93 Difference]: Finished difference Result 936 states and 2615 transitions. [2019-12-26 23:05:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:05:53,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 23:05:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:53,227 INFO L225 Difference]: With dead ends: 936 [2019-12-26 23:05:53,227 INFO L226 Difference]: Without dead ends: 936 [2019-12-26 23:05:53,228 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-26 23:05:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2019-12-26 23:05:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 936. [2019-12-26 23:05:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2019-12-26 23:05:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 2615 transitions. [2019-12-26 23:05:53,242 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 2615 transitions. Word has length 59 [2019-12-26 23:05:53,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:53,243 INFO L462 AbstractCegarLoop]: Abstraction has 936 states and 2615 transitions. [2019-12-26 23:05:53,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:05:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 2615 transitions. [2019-12-26 23:05:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:05:53,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:53,246 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-26 23:05:53,246 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:53,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1664209591, now seen corresponding path program 1 times [2019-12-26 23:05:53,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:53,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535147231] [2019-12-26 23:05:53,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:53,692 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-26 23:05:53,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535147231] [2019-12-26 23:05:53,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:53,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:05:53,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297622340] [2019-12-26 23:05:53,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:05:53,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:53,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:05:53,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:05:53,695 INFO L87 Difference]: Start difference. First operand 936 states and 2615 transitions. Second operand 12 states. [2019-12-26 23:05:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:54,669 INFO L93 Difference]: Finished difference Result 2131 states and 5455 transitions. [2019-12-26 23:05:54,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 23:05:54,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-26 23:05:54,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:54,673 INFO L225 Difference]: With dead ends: 2131 [2019-12-26 23:05:54,673 INFO L226 Difference]: Without dead ends: 1290 [2019-12-26 23:05:54,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:05:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-12-26 23:05:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 796. [2019-12-26 23:05:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-12-26 23:05:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2144 transitions. [2019-12-26 23:05:54,690 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2144 transitions. Word has length 60 [2019-12-26 23:05:54,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:54,691 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 2144 transitions. [2019-12-26 23:05:54,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:05:54,691 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2144 transitions. [2019-12-26 23:05:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:05:54,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:54,693 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-26 23:05:54,694 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:54,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:54,694 INFO L82 PathProgramCache]: Analyzing trace with hash -92263015, now seen corresponding path program 2 times [2019-12-26 23:05:54,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:54,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761567286] [2019-12-26 23:05:54,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:54,823 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-26 23:05:54,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761567286] [2019-12-26 23:05:54,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:54,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:05:54,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073401105] [2019-12-26 23:05:54,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:05:54,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:54,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:05:54,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:05:54,826 INFO L87 Difference]: Start difference. First operand 796 states and 2144 transitions. Second operand 6 states. [2019-12-26 23:05:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:54,914 INFO L93 Difference]: Finished difference Result 1501 states and 3804 transitions. [2019-12-26 23:05:54,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:05:54,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-26 23:05:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:54,916 INFO L225 Difference]: With dead ends: 1501 [2019-12-26 23:05:54,916 INFO L226 Difference]: Without dead ends: 611 [2019-12-26 23:05:54,916 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-26 23:05:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-12-26 23:05:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 449. [2019-12-26 23:05:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-12-26 23:05:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 979 transitions. [2019-12-26 23:05:54,924 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 979 transitions. Word has length 60 [2019-12-26 23:05:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:54,924 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 979 transitions. [2019-12-26 23:05:54,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:05:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 979 transitions. [2019-12-26 23:05:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:05:54,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:54,926 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-26 23:05:54,926 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:54,926 INFO L82 PathProgramCache]: Analyzing trace with hash -837634653, now seen corresponding path program 3 times [2019-12-26 23:05:54,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:54,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249601531] [2019-12-26 23:05:54,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:05:55,034 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-26 23:05:55,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249601531] [2019-12-26 23:05:55,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:05:55,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:05:55,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264525728] [2019-12-26 23:05:55,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:05:55,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:05:55,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:05:55,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:05:55,037 INFO L87 Difference]: Start difference. First operand 449 states and 979 transitions. Second operand 5 states. [2019-12-26 23:05:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:05:55,082 INFO L93 Difference]: Finished difference Result 631 states and 1298 transitions. [2019-12-26 23:05:55,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:05:55,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-26 23:05:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:05:55,084 INFO L225 Difference]: With dead ends: 631 [2019-12-26 23:05:55,084 INFO L226 Difference]: Without dead ends: 213 [2019-12-26 23:05:55,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:05:55,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-26 23:05:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-12-26 23:05:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-12-26 23:05:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 368 transitions. [2019-12-26 23:05:55,087 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 368 transitions. Word has length 60 [2019-12-26 23:05:55,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:05:55,088 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 368 transitions. [2019-12-26 23:05:55,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:05:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 368 transitions. [2019-12-26 23:05:55,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 23:05:55,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:05:55,089 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-26 23:05:55,089 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:05:55,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:05:55,089 INFO L82 PathProgramCache]: Analyzing trace with hash -524819563, now seen corresponding path program 4 times [2019-12-26 23:05:55,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:05:55,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343578348] [2019-12-26 23:05:55,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:05:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:05:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:05:55,263 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:05:55,263 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:05:55,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] ULTIMATE.startENTRY-->L821: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~weak$$choice2~0_146 0) (= v_~z$w_buff0_used~0_885 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$r_buff1_thd0~0_298 0) (= 0 v_~z$r_buff1_thd2~0_83) (= 0 v_~z$r_buff1_thd4~0_140) (= 0 v_~z$r_buff1_thd1~0_83) (= 0 v_~z$flush_delayed~0_36) (= v_~z$r_buff0_thd3~0_92 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1525~0.base_24| 1)) (= v_~z$read_delayed_var~0.offset_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1525~0.base_24|) 0) (= 0 |v_ULTIMATE.start_main_~#t1525~0.offset_18|) (< 0 |v_#StackHeapBarrier_18|) (= v_~__unbuffered_p3_EAX~0_100 0) (= v_~z$w_buff0~0_503 0) (= v_~z$w_buff1_used~0_515 0) (= v_~a~0_48 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1525~0.base_24|) (= v_~x~0_57 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z~0_155 0) (= v_~main$tmp_guard1~0_32 0) (= 0 v_~weak$$choice0~0_16) (= v_~__unbuffered_cnt~0_141 0) (= 0 v_~z$r_buff1_thd3~0_146) (= v_~z$w_buff1~0_306 0) (= v_~z$r_buff0_thd0~0_394 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff0_thd2~0_32 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1525~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1525~0.base_24|) |v_ULTIMATE.start_main_~#t1525~0.offset_18| 0)) |v_#memory_int_25|) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd4~0_161) (= v_~y~0_76 0) (= v_~z$r_buff0_thd1~0_32 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1525~0.base_24| 4)) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_59|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_83, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_41|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_32|, ULTIMATE.start_main_~#t1527~0.offset=|v_ULTIMATE.start_main_~#t1527~0.offset_16|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_35|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_30|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_45|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_394, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_161, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_100, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_48|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_114|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_515, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_191|, ~z$flush_delayed~0=v_~z$flush_delayed~0_36, ULTIMATE.start_main_~#t1525~0.offset=|v_ULTIMATE.start_main_~#t1525~0.offset_18|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_35|, ULTIMATE.start_main_~#t1526~0.base=|v_ULTIMATE.start_main_~#t1526~0.base_22|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ULTIMATE.start_main_~#t1525~0.base=|v_ULTIMATE.start_main_~#t1525~0.base_24|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_38|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_92, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_57, ULTIMATE.start_main_~#t1526~0.offset=|v_ULTIMATE.start_main_~#t1526~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_140, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_40|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~z$w_buff1~0=v_~z$w_buff1~0_306, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_43|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_31|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_29|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_51|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_298, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_25|, ULTIMATE.start_main_~#t1527~0.base=|v_ULTIMATE.start_main_~#t1527~0.base_20|, ULTIMATE.start_main_~#t1528~0.offset=|v_ULTIMATE.start_main_~#t1528~0.offset_17|, ~y~0=v_~y~0_76, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_885, ~z$w_buff0~0=v_~z$w_buff0~0_503, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_39|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_25|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_146, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_122|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_36|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ULTIMATE.start_main_~#t1528~0.base=|v_ULTIMATE.start_main_~#t1528~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_23|, ~z~0=v_~z~0_155, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1527~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1525~0.offset, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1526~0.base, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1525~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1526~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1527~0.base, ULTIMATE.start_main_~#t1528~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1528~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:05:55,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L821-1-->L823: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1526~0.offset_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1526~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1526~0.base_10|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1526~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1526~0.base_10|) |v_ULTIMATE.start_main_~#t1526~0.offset_9| 1)) |v_#memory_int_13|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1526~0.base_10| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1526~0.base_10|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1526~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1526~0.base=|v_ULTIMATE.start_main_~#t1526~0.base_10|, ULTIMATE.start_main_~#t1526~0.offset=|v_ULTIMATE.start_main_~#t1526~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1526~0.base, ULTIMATE.start_main_~#t1526~0.offset] because there is no mapped edge [2019-12-26 23:05:55,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L823-1-->L825: Formula: (and (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t1527~0.base_12| 1)) (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t1527~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1527~0.base_12| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1527~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1527~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1527~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1527~0.base_12|) |v_ULTIMATE.start_main_~#t1527~0.offset_10| 2)) |v_#memory_int_17|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1527~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1527~0.offset=|v_ULTIMATE.start_main_~#t1527~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1527~0.base=|v_ULTIMATE.start_main_~#t1527~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1527~0.offset, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1527~0.base, #length] because there is no mapped edge [2019-12-26 23:05:55,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L825-1-->L827: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1528~0.base_11| 4) |v_#length_19|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1528~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1528~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1528~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1528~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1528~0.base_11|) |v_ULTIMATE.start_main_~#t1528~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1528~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1528~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1528~0.base=|v_ULTIMATE.start_main_~#t1528~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ULTIMATE.start_main_~#t1528~0.offset=|v_ULTIMATE.start_main_~#t1528~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1528~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1528~0.offset] because there is no mapped edge [2019-12-26 23:05:55,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11| 1) (= v_P3Thread1of1ForFork2_~arg.offset_11 |v_P3Thread1of1ForFork2_#in~arg.offset_11|) (= (mod v_~z$w_buff1_used~0_99 256) 0) (= |v_P3Thread1of1ForFork2_#in~arg.base_11| v_P3Thread1of1ForFork2_~arg.base_11) (= v_~z$w_buff0_used~0_218 1) (= v_~z$w_buff0~0_48 v_~z$w_buff1~0_32) (= 2 v_~z$w_buff0~0_47) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|) (= v_~z$w_buff0_used~0_219 v_~z$w_buff1_used~0_99)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_219, ~z$w_buff0~0=v_~z$w_buff0~0_48, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_13, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_11, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_218, ~z$w_buff0~0=v_~z$w_buff0~0_47, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_99, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_11|, ~z$w_buff1~0=v_~z$w_buff1~0_32, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_11|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_11, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_11|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-26 23:05:55,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_19 |v_P0Thread1of1ForFork3_#in~arg.base_19|) (= v_~x~0_44 1) (= 0 |v_P0Thread1of1ForFork3_#res.base_11|) (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P0Thread1of1ForFork3_#in~arg.offset_19| v_P0Thread1of1ForFork3_~arg.offset_19) (= 0 |v_P0Thread1of1ForFork3_#res.offset_11|) (= v_~a~0_40 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|} OutVars{~a~0=v_~a~0_40, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_19|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_19, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_11|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_19, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_19|, ~x~0=v_~x~0_44} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-26 23:05:55,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_39 2) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_~y~0_50 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_10| v_P1Thread1of1ForFork0_~arg.offset_10) (= v_P1Thread1of1ForFork0_~arg.base_10 |v_P1Thread1of1ForFork0_#in~arg.base_10|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_10, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_10, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_10|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_50, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-26 23:05:55,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L768-2-->L768-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1253334648 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1253334648 256))) (.cse2 (= |P2Thread1of1ForFork1_#t~ite4_Out1253334648| |P2Thread1of1ForFork1_#t~ite3_Out1253334648|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff1~0_In1253334648 |P2Thread1of1ForFork1_#t~ite3_Out1253334648|)) (and (or .cse1 .cse0) .cse2 (= ~z~0_In1253334648 |P2Thread1of1ForFork1_#t~ite3_Out1253334648|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1253334648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1253334648, ~z$w_buff1~0=~z$w_buff1~0_In1253334648, ~z~0=~z~0_In1253334648} OutVars{P2Thread1of1ForFork1_#t~ite4=|P2Thread1of1ForFork1_#t~ite4_Out1253334648|, P2Thread1of1ForFork1_#t~ite3=|P2Thread1of1ForFork1_#t~ite3_Out1253334648|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1253334648, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1253334648, ~z$w_buff1~0=~z$w_buff1~0_In1253334648, ~z~0=~z~0_In1253334648} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite4, P2Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-26 23:05:55,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1824259227 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1824259227 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite5_Out1824259227| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1824259227 |P2Thread1of1ForFork1_#t~ite5_Out1824259227|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1824259227, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1824259227} OutVars{P2Thread1of1ForFork1_#t~ite5=|P2Thread1of1ForFork1_#t~ite5_Out1824259227|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1824259227, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1824259227} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 23:05:55,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In197057894 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In197057894 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In197057894 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In197057894 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite6_Out197057894| ~z$w_buff1_used~0_In197057894) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite6_Out197057894|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In197057894, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In197057894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In197057894, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In197057894} OutVars{P2Thread1of1ForFork1_#t~ite6=|P2Thread1of1ForFork1_#t~ite6_Out197057894|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In197057894, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In197057894, ~z$w_buff1_used~0=~z$w_buff1_used~0_In197057894, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In197057894} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 23:05:55,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1159944637 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1159944637 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite7_Out1159944637| ~z$r_buff0_thd3~0_In1159944637)) (and (= |P2Thread1of1ForFork1_#t~ite7_Out1159944637| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1159944637, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1159944637} OutVars{P2Thread1of1ForFork1_#t~ite7=|P2Thread1of1ForFork1_#t~ite7_Out1159944637|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1159944637, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1159944637} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-26 23:05:55,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-471442849 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-471442849 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-471442849 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-471442849 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_Out-471442849| ~z$r_buff1_thd3~0_In-471442849) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite8_Out-471442849| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-471442849, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-471442849, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-471442849, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-471442849} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-471442849, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-471442849, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-471442849, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-471442849, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-471442849|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 23:05:55,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L772-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~z$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork1_#t~ite8_46|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_46|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|, P2Thread1of1ForFork1_#t~ite8=|v_P2Thread1of1ForFork1_#t~ite8_45|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 23:05:55,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1259571028 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1259571028 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite11_Out1259571028| ~z$w_buff0_used~0_In1259571028)) (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite11_Out1259571028|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1259571028, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1259571028} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1259571028, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1259571028, P3Thread1of1ForFork2_#t~ite11=|P3Thread1of1ForFork2_#t~ite11_Out1259571028|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 23:05:55,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L800-->L800-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1564618040 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1564618040 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1564618040 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1564618040 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite12_Out-1564618040| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite12_Out-1564618040| ~z$w_buff1_used~0_In-1564618040)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1564618040, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1564618040, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1564618040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1564618040} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1564618040, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1564618040, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1564618040, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1564618040, P3Thread1of1ForFork2_#t~ite12=|P3Thread1of1ForFork2_#t~ite12_Out-1564618040|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 23:05:55,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L801-->L802: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In237349077 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In237349077 256) 0))) (or (and (= 0 ~z$r_buff0_thd4~0_Out237349077) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_In237349077 ~z$r_buff0_thd4~0_Out237349077) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In237349077, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In237349077} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In237349077, P3Thread1of1ForFork2_#t~ite13=|P3Thread1of1ForFork2_#t~ite13_Out237349077|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out237349077} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite13, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-26 23:05:55,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-181964243 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-181964243 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-181964243 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-181964243 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite14_Out-181964243|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd4~0_In-181964243 |P3Thread1of1ForFork2_#t~ite14_Out-181964243|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-181964243, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-181964243, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-181964243, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-181964243} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-181964243, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-181964243, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-181964243, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-181964243, P3Thread1of1ForFork2_#t~ite14=|P3Thread1of1ForFork2_#t~ite14_Out-181964243|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 23:05:55,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L802-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite14_56| v_~z$r_buff1_thd4~0_130) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_130, P3Thread1of1ForFork2_#t~ite14=|v_P3Thread1of1ForFork2_#t~ite14_55|, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#t~ite14, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:05:55,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L827-1-->L833: Formula: (and (= 4 v_~__unbuffered_cnt~0_21) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-26 23:05:55,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L833-2-->L833-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In424463531 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In424463531 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In424463531 |ULTIMATE.start_main_#t~ite19_Out424463531|)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In424463531 |ULTIMATE.start_main_#t~ite19_Out424463531|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In424463531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424463531, ~z$w_buff1~0=~z$w_buff1~0_In424463531, ~z~0=~z~0_In424463531} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out424463531|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In424463531, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424463531, ~z$w_buff1~0=~z$w_buff1~0_In424463531, ~z~0=~z~0_In424463531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-26 23:05:55,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L833-4-->L834: Formula: (= v_~z~0_31 |v_ULTIMATE.start_main_#t~ite19_8|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_7|, ~z~0=v_~z~0_31, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 23:05:55,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-170249742 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-170249742 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-170249742| ~z$w_buff0_used~0_In-170249742)) (and (= |ULTIMATE.start_main_#t~ite21_Out-170249742| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-170249742, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-170249742} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-170249742, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-170249742, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-170249742|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 23:05:55,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L835-->L835-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In1167940235 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1167940235 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1167940235 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1167940235 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out1167940235|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1167940235 |ULTIMATE.start_main_#t~ite22_Out1167940235|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1167940235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1167940235, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1167940235, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1167940235} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1167940235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1167940235, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1167940235, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1167940235, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1167940235|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 23:05:55,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1328188994 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1328188994 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out1328188994|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1328188994 |ULTIMATE.start_main_#t~ite23_Out1328188994|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1328188994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1328188994} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1328188994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1328188994, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1328188994|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 23:05:55,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L837-->L837-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In29417051 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In29417051 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In29417051 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In29417051 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite24_Out29417051| 0)) (and (= ~z$r_buff1_thd0~0_In29417051 |ULTIMATE.start_main_#t~ite24_Out29417051|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In29417051, ~z$w_buff0_used~0=~z$w_buff0_used~0_In29417051, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In29417051, ~z$w_buff1_used~0=~z$w_buff1_used~0_In29417051} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In29417051, ~z$w_buff0_used~0=~z$w_buff0_used~0_In29417051, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In29417051, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out29417051|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In29417051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 23:05:55,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L849-->L850: Formula: (and (= v_~z$r_buff0_thd0~0_119 v_~z$r_buff0_thd0~0_120) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_29, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 23:05:55,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L850-->L850-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1080988023 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1080988023| ~z$r_buff1_thd0~0_In1080988023) (= |ULTIMATE.start_main_#t~ite45_In1080988023| |ULTIMATE.start_main_#t~ite45_Out1080988023|) (not .cse0)) (and .cse0 (= |ULTIMATE.start_main_#t~ite45_Out1080988023| |ULTIMATE.start_main_#t~ite46_Out1080988023|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1080988023 256)))) (or (= (mod ~z$w_buff0_used~0_In1080988023 256) 0) (and (= 0 (mod ~z$r_buff1_thd0~0_In1080988023 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In1080988023 256)) .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out1080988023| ~z$r_buff1_thd0~0_In1080988023)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1080988023, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1080988023, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1080988023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1080988023, ~weak$$choice2~0=~weak$$choice2~0_In1080988023, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In1080988023|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1080988023, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1080988023, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1080988023, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1080988023, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1080988023|, ~weak$$choice2~0=~weak$$choice2~0_In1080988023, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1080988023|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:05:55,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L852-->L855-1: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_120) (= 0 v_~z$flush_delayed~0_24) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (not (= 0 (mod v_~z$flush_delayed~0_25 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_25} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ~z~0=v_~z~0_120, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:05:55,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L855-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:05:55,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:05:55 BasicIcfg [2019-12-26 23:05:55,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:05:55,449 INFO L168 Benchmark]: Toolchain (without parser) took 25537.03 ms. Allocated memory was 145.2 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 101.5 MB in the beginning and 714.6 MB in the end (delta: -613.1 MB). Peak memory consumption was 536.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:55,449 INFO L168 Benchmark]: CDTParser took 1.43 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 23:05:55,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.28 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 155.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:55,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.68 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:55,454 INFO L168 Benchmark]: Boogie Preprocessor took 37.74 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 150.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:55,455 INFO L168 Benchmark]: RCFGBuilder took 812.08 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 101.3 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:55,457 INFO L168 Benchmark]: TraceAbstraction took 23828.49 ms. Allocated memory was 202.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 101.3 MB in the beginning and 714.6 MB in the end (delta: -613.2 MB). Peak memory consumption was 478.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:05:55,460 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.28 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.1 MB in the beginning and 155.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.68 ms. Allocated memory is still 202.4 MB. Free memory was 155.3 MB in the beginning and 152.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.74 ms. Allocated memory is still 202.4 MB. Free memory was 152.4 MB in the beginning and 150.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 812.08 ms. Allocated memory is still 202.4 MB. Free memory was 149.5 MB in the beginning and 101.3 MB in the end (delta: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23828.49 ms. Allocated memory was 202.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 101.3 MB in the beginning and 714.6 MB in the end (delta: -613.2 MB). Peak memory consumption was 478.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 178 ProgramPointsBefore, 91 ProgramPointsAfterwards, 206 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 24 ChoiceCompositions, 4617 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 231 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 56276 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L821] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L788] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L789] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L790] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L791] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L792] 4 z$r_buff0_thd4 = (_Bool)1 [L795] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 3 y = 2 [L765] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L769] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L771] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L799] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L800] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L835] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L836] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L837] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L840] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L841] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L842] 0 z$flush_delayed = weak$$choice2 [L843] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L845] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L847] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L848] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 23.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1532 SDtfs, 1764 SDslu, 2778 SDs, 0 SdLazy, 1207 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46670occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 6190 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 632 NumberOfCodeBlocks, 632 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 88952 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...