/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-8a14012e553caa636f65c1137831746b6d9875cd-8a14012 [2021-08-06 18:58:21,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-06 18:58:21,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-06 18:58:21,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-06 18:58:21,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-06 18:58:21,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-06 18:58:21,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-06 18:58:21,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-06 18:58:21,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-06 18:58:21,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-06 18:58:21,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-06 18:58:21,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-06 18:58:21,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-06 18:58:21,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-06 18:58:21,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-06 18:58:21,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-06 18:58:21,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-06 18:58:21,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-06 18:58:21,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-06 18:58:21,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-06 18:58:21,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-06 18:58:21,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-06 18:58:21,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-06 18:58:21,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-06 18:58:21,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-06 18:58:21,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-06 18:58:21,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-06 18:58:21,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-06 18:58:21,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-06 18:58:21,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-06 18:58:21,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-06 18:58:21,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-06 18:58:21,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-06 18:58:21,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-06 18:58:21,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-06 18:58:21,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-06 18:58:21,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-06 18:58:21,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-06 18:58:21,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-06 18:58:21,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-06 18:58:21,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-06 18:58:21,657 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf [2021-08-06 18:58:21,694 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-06 18:58:21,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-06 18:58:21,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-06 18:58:21,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-06 18:58:21,698 INFO L138 SettingsManager]: * Use SBE=true [2021-08-06 18:58:21,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-06 18:58:21,699 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-06 18:58:21,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-06 18:58:21,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-06 18:58:21,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-06 18:58:21,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-06 18:58:21,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-06 18:58:21,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-06 18:58:21,700 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-06 18:58:21,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-06 18:58:21,701 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-06 18:58:21,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-06 18:58:21,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-06 18:58:21,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-06 18:58:21,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-06 18:58:21,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-06 18:58:21,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 18:58:21,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-06 18:58:21,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-06 18:58:21,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-06 18:58:21,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-06 18:58:21,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-06 18:58:21,703 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-06 18:58:21,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-06 18:58:21,703 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-06 18:58:21,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-06 18:58:22,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-06 18:58:22,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-06 18:58:22,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-06 18:58:22,044 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-06 18:58:22,054 INFO L275 PluginConnector]: CDTParser initialized [2021-08-06 18:58:22,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2021-08-06 18:58:22,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01dadabba/de30126f91d44ca184346f1899172138/FLAGea829f98e [2021-08-06 18:58:22,626 INFO L306 CDTParser]: Found 1 translation units. [2021-08-06 18:58:22,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i [2021-08-06 18:58:22,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01dadabba/de30126f91d44ca184346f1899172138/FLAGea829f98e [2021-08-06 18:58:22,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01dadabba/de30126f91d44ca184346f1899172138 [2021-08-06 18:58:22,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-06 18:58:22,963 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-06 18:58:22,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-06 18:58:22,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-06 18:58:22,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-06 18:58:22,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 06:58:22" (1/1) ... [2021-08-06 18:58:22,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ecfc423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:22, skipping insertion in model container [2021-08-06 18:58:22,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 06:58:22" (1/1) ... [2021-08-06 18:58:22,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-06 18:58:23,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-06 18:58:23,200 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i[948,961] [2021-08-06 18:58:23,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 18:58:23,431 INFO L203 MainTranslator]: Completed pre-run [2021-08-06 18:58:23,470 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_pso.opt.i[948,961] [2021-08-06 18:58:23,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 18:58:23,547 INFO L208 MainTranslator]: Completed translation [2021-08-06 18:58:23,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23 WrapperNode [2021-08-06 18:58:23,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-06 18:58:23,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-06 18:58:23,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-06 18:58:23,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-06 18:58:23,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23" (1/1) ... [2021-08-06 18:58:23,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23" (1/1) ... [2021-08-06 18:58:23,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-06 18:58:23,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-06 18:58:23,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-06 18:58:23,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-06 18:58:23,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23" (1/1) ... [2021-08-06 18:58:23,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23" (1/1) ... [2021-08-06 18:58:23,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23" (1/1) ... [2021-08-06 18:58:23,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23" (1/1) ... [2021-08-06 18:58:23,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23" (1/1) ... [2021-08-06 18:58:23,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23" (1/1) ... [2021-08-06 18:58:23,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23" (1/1) ... [2021-08-06 18:58:23,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-06 18:58:23,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-06 18:58:23,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-06 18:58:23,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-06 18:58:23,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23" (1/1) ... [2021-08-06 18:58:23,680 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 18:58:23,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-06 18:58:23,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-06 18:58:23,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-06 18:58:23,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-06 18:58:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-06 18:58:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-06 18:58:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-06 18:58:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-06 18:58:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-06 18:58:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-06 18:58:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-06 18:58:23,738 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-06 18:58:23,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-06 18:58:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-06 18:58:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-06 18:58:23,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-06 18:58:23,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-06 18:58:23,740 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-06 18:58:25,461 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-06 18:58:25,461 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-06 18:58:25,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 06:58:25 BoogieIcfgContainer [2021-08-06 18:58:25,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-06 18:58:25,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-06 18:58:25,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-06 18:58:25,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-06 18:58:25,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 06:58:22" (1/3) ... [2021-08-06 18:58:25,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2370c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 06:58:25, skipping insertion in model container [2021-08-06 18:58:25,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 06:58:23" (2/3) ... [2021-08-06 18:58:25,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2370c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 06:58:25, skipping insertion in model container [2021-08-06 18:58:25,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 06:58:25" (3/3) ... [2021-08-06 18:58:25,469 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_pso.opt.i [2021-08-06 18:58:25,473 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-06 18:58:25,474 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-06 18:58:25,474 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-06 18:58:25,474 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-06 18:58:25,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,509 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,509 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,509 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,509 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,512 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,512 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,519 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,519 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,519 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,520 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,527 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,527 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,531 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,531 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,532 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,532 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,532 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,533 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,534 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,537 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 18:58:25,542 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-06 18:58:25,572 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P2Thread1of1ForFork1 ======== [2021-08-06 18:58:25,576 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-06 18:58:25,577 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-06 18:58:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 5018 states, 4934 states have (on average 2.126469396027564) internal successors, (10492), 5017 states have internal predecessors, (10492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-06 18:58:26,304 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:26,305 INFO L512 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] [2021-08-06 18:58:26,306 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-06 18:58:26,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2131725919, now seen corresponding path program 1 times [2021-08-06 18:58:26,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:26,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322514547] [2021-08-06 18:58:26,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:26,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:26,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:26,643 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322514547] [2021-08-06 18:58:26,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322514547] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:26,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:26,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-06 18:58:26,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867462193] [2021-08-06 18:58:26,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-06 18:58:26,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:26,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-06 18:58:26,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-06 18:58:26,681 INFO L87 Difference]: Start difference. First operand has 5018 states, 4934 states have (on average 2.126469396027564) internal successors, (10492), 5017 states have internal predecessors, (10492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:26,754 INFO L93 Difference]: Finished difference Result 3394 states and 6447 transitions. [2021-08-06 18:58:26,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-06 18:58:26,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-08-06 18:58:26,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:26,761 INFO L225 Difference]: With dead ends: 3394 [2021-08-06 18:58:26,761 INFO L226 Difference]: Without dead ends: 0 [2021-08-06 18:58:26,762 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-06 18:58:26,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-06 18:58:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-06 18:58:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-06 18:58:26,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2021-08-06 18:58:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:26,783 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-06 18:58:26,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 28.5) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-06 18:58:26,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-06 18:58:26,787 INFO L764 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 18:58:26,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-06 18:58:26,789 INFO L308 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork1 was SAFE (1/2) [2021-08-06 18:58:26,797 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-08-06 18:58:26,801 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-06 18:58:26,802 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-06 18:58:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 10338 states, 9156 states have (on average 2.000982961992136) internal successors, (18321), 10337 states have internal predecessors, (18321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-06 18:58:27,882 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:27,883 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:27,883 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:27,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1515532374, now seen corresponding path program 1 times [2021-08-06 18:58:27,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:27,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166844031] [2021-08-06 18:58:27,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:27,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:28,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:28,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166844031] [2021-08-06 18:58:28,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166844031] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:28,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:28,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 18:58:28,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810752281] [2021-08-06 18:58:28,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 18:58:28,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:28,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 18:58:28,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 18:58:28,173 INFO L87 Difference]: Start difference. First operand has 10338 states, 9156 states have (on average 2.000982961992136) internal successors, (18321), 10337 states have internal predecessors, (18321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:28,452 INFO L93 Difference]: Finished difference Result 11122 states and 19947 transitions. [2021-08-06 18:58:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 18:58:28,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-08-06 18:58:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:28,490 INFO L225 Difference]: With dead ends: 11122 [2021-08-06 18:58:28,490 INFO L226 Difference]: Without dead ends: 4649 [2021-08-06 18:58:28,491 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 86.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 18:58:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2021-08-06 18:58:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 4649. [2021-08-06 18:58:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4649 states, 4593 states have (on average 2.045286305247115) internal successors, (9394), 4648 states have internal predecessors, (9394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4649 states to 4649 states and 9394 transitions. [2021-08-06 18:58:28,681 INFO L78 Accepts]: Start accepts. Automaton has 4649 states and 9394 transitions. Word has length 69 [2021-08-06 18:58:28,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:28,682 INFO L470 AbstractCegarLoop]: Abstraction has 4649 states and 9394 transitions. [2021-08-06 18:58:28,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4649 states and 9394 transitions. [2021-08-06 18:58:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-06 18:58:28,690 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:28,690 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:28,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-06 18:58:28,690 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:28,691 INFO L82 PathProgramCache]: Analyzing trace with hash -899569671, now seen corresponding path program 1 times [2021-08-06 18:58:28,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:28,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801806749] [2021-08-06 18:58:28,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:28,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:28,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:28,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801806749] [2021-08-06 18:58:28,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801806749] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:28,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:28,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 18:58:28,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659398098] [2021-08-06 18:58:28,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 18:58:28,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:28,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 18:58:28,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 18:58:28,867 INFO L87 Difference]: Start difference. First operand 4649 states and 9394 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:29,014 INFO L93 Difference]: Finished difference Result 5389 states and 11582 transitions. [2021-08-06 18:58:29,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 18:58:29,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-06 18:58:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:29,036 INFO L225 Difference]: With dead ends: 5389 [2021-08-06 18:58:29,037 INFO L226 Difference]: Without dead ends: 4339 [2021-08-06 18:58:29,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 93.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 18:58:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states. [2021-08-06 18:58:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 4339. [2021-08-06 18:58:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4339 states, 4289 states have (on average 2.0517603170902308) internal successors, (8800), 4338 states have internal predecessors, (8800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 8800 transitions. [2021-08-06 18:58:29,221 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 8800 transitions. Word has length 73 [2021-08-06 18:58:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:29,222 INFO L470 AbstractCegarLoop]: Abstraction has 4339 states and 8800 transitions. [2021-08-06 18:58:29,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 8800 transitions. [2021-08-06 18:58:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 18:58:29,235 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:29,235 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:29,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-06 18:58:29,235 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:29,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1261244532, now seen corresponding path program 1 times [2021-08-06 18:58:29,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:29,237 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209048544] [2021-08-06 18:58:29,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:29,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:29,481 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 18:58:29,491 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 18:58:29,530 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 31, result has 69.0 percent of original size [2021-08-06 18:58:29,550 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 31, result has 69.0 percent of original size [2021-08-06 18:58:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:29,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:29,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209048544] [2021-08-06 18:58:29,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209048544] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:29,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:29,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 18:58:29,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487494023] [2021-08-06 18:58:29,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 18:58:29,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 18:58:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-06 18:58:29,654 INFO L87 Difference]: Start difference. First operand 4339 states and 8800 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:29,934 INFO L93 Difference]: Finished difference Result 4959 states and 10540 transitions. [2021-08-06 18:58:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 18:58:29,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-06 18:58:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:29,955 INFO L225 Difference]: With dead ends: 4959 [2021-08-06 18:58:29,955 INFO L226 Difference]: Without dead ends: 4159 [2021-08-06 18:58:29,955 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 153.7ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-08-06 18:58:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4159 states. [2021-08-06 18:58:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4159 to 4159. [2021-08-06 18:58:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4159 states, 4109 states have (on average 1.9912387442200048) internal successors, (8182), 4158 states have internal predecessors, (8182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:30,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4159 states to 4159 states and 8182 transitions. [2021-08-06 18:58:30,072 INFO L78 Accepts]: Start accepts. Automaton has 4159 states and 8182 transitions. Word has length 75 [2021-08-06 18:58:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:30,072 INFO L470 AbstractCegarLoop]: Abstraction has 4159 states and 8182 transitions. [2021-08-06 18:58:30,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:30,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4159 states and 8182 transitions. [2021-08-06 18:58:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-06 18:58:30,080 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:30,080 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:30,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-06 18:58:30,082 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:30,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:30,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1059701843, now seen corresponding path program 1 times [2021-08-06 18:58:30,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:30,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915843829] [2021-08-06 18:58:30,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:30,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:30,397 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 44, result has 61.1 percent of original size [2021-08-06 18:58:30,415 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 44, result has 61.1 percent of original size [2021-08-06 18:58:30,451 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 18, result has 72.7 percent of original size [2021-08-06 18:58:30,458 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 18, result has 72.7 percent of original size [2021-08-06 18:58:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:30,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:30,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915843829] [2021-08-06 18:58:30,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915843829] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:30,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:30,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-06 18:58:30,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158501081] [2021-08-06 18:58:30,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-06 18:58:30,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:30,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-06 18:58:30,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-08-06 18:58:30,539 INFO L87 Difference]: Start difference. First operand 4159 states and 8182 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:30,918 INFO L93 Difference]: Finished difference Result 4771 states and 9943 transitions. [2021-08-06 18:58:30,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 18:58:30,919 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-06 18:58:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:30,938 INFO L225 Difference]: With dead ends: 4771 [2021-08-06 18:58:30,938 INFO L226 Difference]: Without dead ends: 4211 [2021-08-06 18:58:30,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 234.7ms TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-08-06 18:58:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4211 states. [2021-08-06 18:58:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4211 to 4201. [2021-08-06 18:58:31,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4201 states, 4151 states have (on average 1.9937364490484222) internal successors, (8276), 4200 states have internal predecessors, (8276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:31,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 8276 transitions. [2021-08-06 18:58:31,051 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 8276 transitions. Word has length 76 [2021-08-06 18:58:31,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:31,052 INFO L470 AbstractCegarLoop]: Abstraction has 4201 states and 8276 transitions. [2021-08-06 18:58:31,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 8276 transitions. [2021-08-06 18:58:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-06 18:58:31,060 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:31,060 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:31,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-06 18:58:31,060 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:31,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:31,061 INFO L82 PathProgramCache]: Analyzing trace with hash -50627667, now seen corresponding path program 2 times [2021-08-06 18:58:31,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:31,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153187064] [2021-08-06 18:58:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:31,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:31,147 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 85.4 percent of original size [2021-08-06 18:58:31,150 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 85.4 percent of original size [2021-08-06 18:58:31,162 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 18:58:31,166 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 18:58:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:31,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:31,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153187064] [2021-08-06 18:58:31,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153187064] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:31,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:31,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 18:58:31,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650564947] [2021-08-06 18:58:31,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 18:58:31,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 18:58:31,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-06 18:58:31,241 INFO L87 Difference]: Start difference. First operand 4201 states and 8276 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:31,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:31,484 INFO L93 Difference]: Finished difference Result 4929 states and 10214 transitions. [2021-08-06 18:58:31,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 18:58:31,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-06 18:58:31,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:31,520 INFO L225 Difference]: With dead ends: 4929 [2021-08-06 18:58:31,520 INFO L226 Difference]: Without dead ends: 4313 [2021-08-06 18:58:31,520 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 134.2ms TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2021-08-06 18:58:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2021-08-06 18:58:31,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4173. [2021-08-06 18:58:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4173 states, 4123 states have (on average 1.951976715983507) internal successors, (8048), 4172 states have internal predecessors, (8048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 8048 transitions. [2021-08-06 18:58:31,647 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 8048 transitions. Word has length 76 [2021-08-06 18:58:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:31,647 INFO L470 AbstractCegarLoop]: Abstraction has 4173 states and 8048 transitions. [2021-08-06 18:58:31,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 8048 transitions. [2021-08-06 18:58:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 18:58:31,659 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:31,659 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:31,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-06 18:58:31,660 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:31,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:31,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2121288329, now seen corresponding path program 1 times [2021-08-06 18:58:31,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:31,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69650491] [2021-08-06 18:58:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:31,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:31,870 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 88.3 percent of original size [2021-08-06 18:58:31,875 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 88.3 percent of original size [2021-08-06 18:58:31,908 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 88.3 percent of original size [2021-08-06 18:58:31,915 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 88.3 percent of original size [2021-08-06 18:58:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:32,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:32,004 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69650491] [2021-08-06 18:58:32,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69650491] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:32,004 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:32,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 18:58:32,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192029352] [2021-08-06 18:58:32,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 18:58:32,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 18:58:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-06 18:58:32,005 INFO L87 Difference]: Start difference. First operand 4173 states and 8048 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:32,286 INFO L93 Difference]: Finished difference Result 5471 states and 10802 transitions. [2021-08-06 18:58:32,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-06 18:58:32,287 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-06 18:58:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:32,306 INFO L225 Difference]: With dead ends: 5471 [2021-08-06 18:58:32,306 INFO L226 Difference]: Without dead ends: 5023 [2021-08-06 18:58:32,306 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 202.0ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-08-06 18:58:32,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2021-08-06 18:58:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4783. [2021-08-06 18:58:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4783 states, 4733 states have (on average 1.925417282907247) internal successors, (9113), 4782 states have internal predecessors, (9113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4783 states to 4783 states and 9113 transitions. [2021-08-06 18:58:32,422 INFO L78 Accepts]: Start accepts. Automaton has 4783 states and 9113 transitions. Word has length 77 [2021-08-06 18:58:32,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:32,422 INFO L470 AbstractCegarLoop]: Abstraction has 4783 states and 9113 transitions. [2021-08-06 18:58:32,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4783 states and 9113 transitions. [2021-08-06 18:58:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 18:58:32,432 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:32,432 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:32,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-06 18:58:32,432 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:32,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:32,433 INFO L82 PathProgramCache]: Analyzing trace with hash 484029103, now seen corresponding path program 2 times [2021-08-06 18:58:32,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:32,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128305343] [2021-08-06 18:58:32,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:32,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:32,607 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 87.0 percent of original size [2021-08-06 18:58:32,611 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 87.0 percent of original size [2021-08-06 18:58:32,641 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 87.7 percent of original size [2021-08-06 18:58:32,646 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 87.7 percent of original size [2021-08-06 18:58:32,680 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 18:58:32,685 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 18:58:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:32,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:32,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128305343] [2021-08-06 18:58:32,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128305343] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:32,764 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:32,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-06 18:58:32,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461851025] [2021-08-06 18:58:32,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-06 18:58:32,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:32,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-06 18:58:32,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-08-06 18:58:32,765 INFO L87 Difference]: Start difference. First operand 4783 states and 9113 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:33,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:33,118 INFO L93 Difference]: Finished difference Result 5641 states and 11183 transitions. [2021-08-06 18:58:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-06 18:58:33,119 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-06 18:58:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:33,134 INFO L225 Difference]: With dead ends: 5641 [2021-08-06 18:58:33,134 INFO L226 Difference]: Without dead ends: 5193 [2021-08-06 18:58:33,135 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 261.2ms TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2021-08-06 18:58:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2021-08-06 18:58:33,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 4406. [2021-08-06 18:58:33,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4406 states, 4356 states have (on average 1.9664830119375574) internal successors, (8566), 4405 states have internal predecessors, (8566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4406 states to 4406 states and 8566 transitions. [2021-08-06 18:58:33,261 INFO L78 Accepts]: Start accepts. Automaton has 4406 states and 8566 transitions. Word has length 77 [2021-08-06 18:58:33,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:33,262 INFO L470 AbstractCegarLoop]: Abstraction has 4406 states and 8566 transitions. [2021-08-06 18:58:33,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 4406 states and 8566 transitions. [2021-08-06 18:58:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 18:58:33,271 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:33,271 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:33,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-06 18:58:33,271 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:33,272 INFO L82 PathProgramCache]: Analyzing trace with hash 423552661, now seen corresponding path program 3 times [2021-08-06 18:58:33,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:33,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969017865] [2021-08-06 18:58:33,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:33,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:33,386 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 8, result has 85.7 percent of original size [2021-08-06 18:58:33,391 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 8, result has 85.7 percent of original size [2021-08-06 18:58:33,412 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 8, result has 86.4 percent of original size [2021-08-06 18:58:33,419 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 8, result has 86.4 percent of original size [2021-08-06 18:58:33,455 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 8, result has 84.9 percent of original size [2021-08-06 18:58:33,460 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 8, result has 84.9 percent of original size [2021-08-06 18:58:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:33,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:33,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969017865] [2021-08-06 18:58:33,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969017865] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:33,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:33,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 18:58:33,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747817392] [2021-08-06 18:58:33,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 18:58:33,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:33,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 18:58:33,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-06 18:58:33,537 INFO L87 Difference]: Start difference. First operand 4406 states and 8566 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:33,806 INFO L93 Difference]: Finished difference Result 5651 states and 11438 transitions. [2021-08-06 18:58:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-06 18:58:33,807 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-06 18:58:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:33,820 INFO L225 Difference]: With dead ends: 5651 [2021-08-06 18:58:33,820 INFO L226 Difference]: Without dead ends: 4489 [2021-08-06 18:58:33,821 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 176.2ms TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2021-08-06 18:58:33,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4489 states. [2021-08-06 18:58:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4489 to 3739. [2021-08-06 18:58:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 3689 states have (on average 1.810788831661697) internal successors, (6680), 3738 states have internal predecessors, (6680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:33,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 6680 transitions. [2021-08-06 18:58:33,914 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 6680 transitions. Word has length 77 [2021-08-06 18:58:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:33,915 INFO L470 AbstractCegarLoop]: Abstraction has 3739 states and 6680 transitions. [2021-08-06 18:58:33,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 6680 transitions. [2021-08-06 18:58:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 18:58:33,921 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:33,921 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:33,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-06 18:58:33,922 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:33,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:33,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1757628459, now seen corresponding path program 1 times [2021-08-06 18:58:33,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:33,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10223506] [2021-08-06 18:58:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:33,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:34,019 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 18:58:34,021 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 18:58:34,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:34,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:34,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10223506] [2021-08-06 18:58:34,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10223506] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:34,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:34,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 18:58:34,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865261566] [2021-08-06 18:58:34,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 18:58:34,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:34,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 18:58:34,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 18:58:34,036 INFO L87 Difference]: Start difference. First operand 3739 states and 6680 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:34,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:34,145 INFO L93 Difference]: Finished difference Result 4615 states and 7928 transitions. [2021-08-06 18:58:34,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 18:58:34,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-06 18:58:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:34,153 INFO L225 Difference]: With dead ends: 4615 [2021-08-06 18:58:34,153 INFO L226 Difference]: Without dead ends: 2911 [2021-08-06 18:58:34,154 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 69.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 18:58:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2021-08-06 18:58:34,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2911. [2021-08-06 18:58:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2911 states, 2861 states have (on average 1.8385180006990562) internal successors, (5260), 2910 states have internal predecessors, (5260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 5260 transitions. [2021-08-06 18:58:34,235 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 5260 transitions. Word has length 77 [2021-08-06 18:58:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:34,235 INFO L470 AbstractCegarLoop]: Abstraction has 2911 states and 5260 transitions. [2021-08-06 18:58:34,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 5260 transitions. [2021-08-06 18:58:34,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-06 18:58:34,240 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:34,241 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:34,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-06 18:58:34,241 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:34,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash 169184570, now seen corresponding path program 1 times [2021-08-06 18:58:34,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:34,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432270980] [2021-08-06 18:58:34,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:34,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:34,342 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 18:58:34,344 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 18:58:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:34,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:34,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432270980] [2021-08-06 18:58:34,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432270980] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:34,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:34,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 18:58:34,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923498798] [2021-08-06 18:58:34,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 18:58:34,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:34,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 18:58:34,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 18:58:34,360 INFO L87 Difference]: Start difference. First operand 2911 states and 5260 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:34,483 INFO L93 Difference]: Finished difference Result 2627 states and 4465 transitions. [2021-08-06 18:58:34,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 18:58:34,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-08-06 18:58:34,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:34,487 INFO L225 Difference]: With dead ends: 2627 [2021-08-06 18:58:34,487 INFO L226 Difference]: Without dead ends: 1394 [2021-08-06 18:58:34,487 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 90.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-06 18:58:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2021-08-06 18:58:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2021-08-06 18:58:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1358 states have (on average 1.8100147275405007) internal successors, (2458), 1393 states have internal predecessors, (2458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2458 transitions. [2021-08-06 18:58:34,511 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2458 transitions. Word has length 78 [2021-08-06 18:58:34,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:34,512 INFO L470 AbstractCegarLoop]: Abstraction has 1394 states and 2458 transitions. [2021-08-06 18:58:34,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2458 transitions. [2021-08-06 18:58:34,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-06 18:58:34,514 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:34,515 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:34,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-06 18:58:34,515 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:34,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:34,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1414746553, now seen corresponding path program 1 times [2021-08-06 18:58:34,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:34,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744284914] [2021-08-06 18:58:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:34,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:34,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:34,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:34,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744284914] [2021-08-06 18:58:34,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744284914] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:34,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:34,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 18:58:34,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045476622] [2021-08-06 18:58:34,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 18:58:34,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:34,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 18:58:34,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-06 18:58:34,668 INFO L87 Difference]: Start difference. First operand 1394 states and 2458 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:34,755 INFO L93 Difference]: Finished difference Result 1942 states and 3669 transitions. [2021-08-06 18:58:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-06 18:58:34,756 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-06 18:58:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:34,758 INFO L225 Difference]: With dead ends: 1942 [2021-08-06 18:58:34,758 INFO L226 Difference]: Without dead ends: 924 [2021-08-06 18:58:34,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-08-06 18:58:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2021-08-06 18:58:34,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 924. [2021-08-06 18:58:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 888 states have (on average 2.0135135135135136) internal successors, (1788), 923 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1788 transitions. [2021-08-06 18:58:34,773 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1788 transitions. Word has length 80 [2021-08-06 18:58:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:34,773 INFO L470 AbstractCegarLoop]: Abstraction has 924 states and 1788 transitions. [2021-08-06 18:58:34,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1788 transitions. [2021-08-06 18:58:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-06 18:58:34,775 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:34,775 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:34,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-06 18:58:34,776 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:34,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1486380287, now seen corresponding path program 2 times [2021-08-06 18:58:34,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:34,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878114138] [2021-08-06 18:58:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:34,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:34,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:34,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878114138] [2021-08-06 18:58:34,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878114138] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:34,888 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:34,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 18:58:34,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206442423] [2021-08-06 18:58:34,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 18:58:34,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 18:58:34,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 18:58:34,890 INFO L87 Difference]: Start difference. First operand 924 states and 1788 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:34,998 INFO L93 Difference]: Finished difference Result 1490 states and 3093 transitions. [2021-08-06 18:58:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 18:58:34,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-06 18:58:34,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:35,000 INFO L225 Difference]: With dead ends: 1490 [2021-08-06 18:58:35,001 INFO L226 Difference]: Without dead ends: 908 [2021-08-06 18:58:35,001 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 18:58:35,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-08-06 18:58:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 812. [2021-08-06 18:58:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 782 states have (on average 2.051150895140665) internal successors, (1604), 811 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1604 transitions. [2021-08-06 18:58:35,015 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1604 transitions. Word has length 80 [2021-08-06 18:58:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:35,016 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1604 transitions. [2021-08-06 18:58:35,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1604 transitions. [2021-08-06 18:58:35,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-06 18:58:35,017 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:35,017 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:35,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-06 18:58:35,018 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:35,018 INFO L82 PathProgramCache]: Analyzing trace with hash 918641726, now seen corresponding path program 1 times [2021-08-06 18:58:35,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:35,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522234816] [2021-08-06 18:58:35,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:35,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 18:58:35,126 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 18:58:35,128 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 18:58:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 18:58:35,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 18:58:35,142 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522234816] [2021-08-06 18:58:35,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522234816] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 18:58:35,142 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 18:58:35,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 18:58:35,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961253268] [2021-08-06 18:58:35,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 18:58:35,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 18:58:35,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 18:58:35,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-06 18:58:35,144 INFO L87 Difference]: Start difference. First operand 812 states and 1604 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:35,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 18:58:35,271 INFO L93 Difference]: Finished difference Result 548 states and 976 transitions. [2021-08-06 18:58:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 18:58:35,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-08-06 18:58:35,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 18:58:35,272 INFO L225 Difference]: With dead ends: 548 [2021-08-06 18:58:35,272 INFO L226 Difference]: Without dead ends: 244 [2021-08-06 18:58:35,273 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 101.3ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-06 18:58:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-08-06 18:58:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-08-06 18:58:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 235 states have (on average 1.774468085106383) internal successors, (417), 243 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 417 transitions. [2021-08-06 18:58:35,276 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 417 transitions. Word has length 81 [2021-08-06 18:58:35,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 18:58:35,277 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 417 transitions. [2021-08-06 18:58:35,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 18:58:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 417 transitions. [2021-08-06 18:58:35,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 18:58:35,277 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 18:58:35,278 INFO L512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 18:58:35,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-06 18:58:35,278 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 18:58:35,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 18:58:35,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1713472400, now seen corresponding path program 1 times [2021-08-06 18:58:35,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 18:58:35,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221503296] [2021-08-06 18:58:35,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 18:58:35,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 18:58:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 18:58:35,311 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-06 18:58:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 18:58:35,389 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-06 18:58:35,389 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-06 18:58:35,390 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 18:58:35,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-06 18:58:35,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-06 18:58:35,390 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-06 18:58:35,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-06 18:58:35,391 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2021-08-06 18:58:35,394 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-06 18:58:35,394 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-06 18:58:35,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 06:58:35 BasicIcfg [2021-08-06 18:58:35,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-06 18:58:35,511 INFO L168 Benchmark]: Toolchain (without parser) took 12547.65 ms. Allocated memory was 216.0 MB in the beginning and 647.0 MB in the end (delta: 431.0 MB). Free memory was 179.6 MB in the beginning and 260.8 MB in the end (delta: -81.2 MB). Peak memory consumption was 350.4 MB. Max. memory is 8.0 GB. [2021-08-06 18:58:35,511 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 216.0 MB. Free memory is still 198.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-06 18:58:35,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.85 ms. Allocated memory is still 216.0 MB. Free memory was 179.5 MB in the beginning and 189.4 MB in the end (delta: -10.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2021-08-06 18:58:35,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.20 ms. Allocated memory is still 216.0 MB. Free memory was 189.4 MB in the beginning and 186.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-06 18:58:35,511 INFO L168 Benchmark]: Boogie Preprocessor took 74.13 ms. Allocated memory is still 216.0 MB. Free memory was 186.8 MB in the beginning and 184.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-06 18:58:35,511 INFO L168 Benchmark]: RCFGBuilder took 1790.57 ms. Allocated memory was 216.0 MB in the beginning and 265.3 MB in the end (delta: 49.3 MB). Free memory was 184.6 MB in the beginning and 219.2 MB in the end (delta: -34.6 MB). Peak memory consumption was 116.0 MB. Max. memory is 8.0 GB. [2021-08-06 18:58:35,511 INFO L168 Benchmark]: TraceAbstraction took 10045.52 ms. Allocated memory was 265.3 MB in the beginning and 647.0 MB in the end (delta: 381.7 MB). Free memory was 218.7 MB in the beginning and 260.8 MB in the end (delta: -42.1 MB). Peak memory consumption was 340.1 MB. Max. memory is 8.0 GB. [2021-08-06 18:58:35,512 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 216.0 MB. Free memory is still 198.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 582.85 ms. Allocated memory is still 216.0 MB. Free memory was 179.5 MB in the beginning and 189.4 MB in the end (delta: -10.0 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 48.20 ms. Allocated memory is still 216.0 MB. Free memory was 189.4 MB in the beginning and 186.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 74.13 ms. Allocated memory is still 216.0 MB. Free memory was 186.8 MB in the beginning and 184.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1790.57 ms. Allocated memory was 216.0 MB in the beginning and 265.3 MB in the end (delta: 49.3 MB). Free memory was 184.6 MB in the beginning and 219.2 MB in the end (delta: -34.6 MB). Peak memory consumption was 116.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10045.52 ms. Allocated memory was 265.3 MB in the beginning and 647.0 MB in the end (delta: 381.7 MB). Free memory was 218.7 MB in the beginning and 260.8 MB in the end (delta: -42.1 MB). Peak memory consumption was 340.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18814, positive: 17833, positive conditional: 17833, positive unconditional: 0, negative: 981, negative conditional: 981, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18310, positive: 17833, positive conditional: 0, positive unconditional: 17833, negative: 477, negative conditional: 0, negative unconditional: 477, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 692, positive: 678, positive conditional: 0, positive unconditional: 678, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 692, positive: 677, positive conditional: 0, positive unconditional: 677, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 175, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 173, negative conditional: 0, negative unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18310, positive: 17155, positive conditional: 0, positive unconditional: 17155, negative: 463, negative conditional: 0, negative unconditional: 463, unknown: 692, unknown conditional: 0, unknown unconditional: 692] , Statistics on independence cache: Total cache size (in pairs): 692, Positive cache size: 678, Positive conditional cache size: 0, Positive unconditional cache size: 678, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Independence queries for same thread: 504 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 36975, positive: 34493, positive conditional: 34493, positive unconditional: 0, negative: 2482, negative conditional: 2482, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35981, positive: 34493, positive conditional: 0, positive unconditional: 34493, negative: 1488, negative conditional: 0, negative unconditional: 1488, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 858, positive: 826, positive conditional: 0, positive unconditional: 826, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 858, positive: 822, positive conditional: 0, positive unconditional: 822, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 370, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 364, negative conditional: 0, negative unconditional: 364, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35981, positive: 33667, positive conditional: 0, positive unconditional: 33667, negative: 1456, negative conditional: 0, negative unconditional: 1456, unknown: 858, unknown conditional: 0, unknown unconditional: 858] , Statistics on independence cache: Total cache size (in pairs): 858, Positive cache size: 826, Positive conditional cache size: 0, Positive unconditional cache size: 826, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Independence queries for same thread: 994 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L715] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L727] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L728] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L729] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L730] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L731] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L732] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L733] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L734] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L735] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L736] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L737] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 0 pthread_t t1202; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1202, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1203; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] FCALL, FORK 0 pthread_create(&t1203, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1204; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L828] FCALL, FORK 0 pthread_create(&t1204, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1219.2ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 39.4ms, AutomataDifference: 113.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 688.0ms, PartialOrderReductionTime: 676.0ms, HoareTripleCheckerStatistics: 91 SDtfs, 35 SDslu, 28 SDs, 0 SdLazy, 3 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5018occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 7.8ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 11.0ms SsaConstructionTime, 62.4ms SatisfiabilityAnalysisTime, 166.9ms InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8594.5ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 124.3ms, AutomataDifference: 3040.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1038.1ms, PartialOrderReductionTime: 1034.8ms, HoareTripleCheckerStatistics: 1703 SDtfs, 2223 SDslu, 6842 SDs, 0 SdLazy, 911 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 929.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1766.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10338occurred in iteration=0, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1199.2ms AutomataMinimizationTime, 13 MinimizatonAttempts, 2023 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.0ms SsaConstructionTime, 468.4ms SatisfiabilityAnalysisTime, 2453.9ms InterpolantComputationTime, 1081 NumberOfCodeBlocks, 1081 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 983 ConstructedInterpolants, 0 QuantifiedInterpolants, 4673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-06 18:58:35,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...