/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/safe001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-8a14012e553caa636f65c1137831746b6d9875cd-8a14012 [2021-08-06 19:02:15,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-06 19:02:15,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-06 19:02:15,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-06 19:02:15,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-06 19:02:15,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-06 19:02:15,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-06 19:02:15,650 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-06 19:02:15,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-06 19:02:15,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-06 19:02:15,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-06 19:02:15,664 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-06 19:02:15,664 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-06 19:02:15,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-06 19:02:15,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-06 19:02:15,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-06 19:02:15,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-06 19:02:15,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-06 19:02:15,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-06 19:02:15,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-06 19:02:15,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-06 19:02:15,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-06 19:02:15,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-06 19:02:15,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-06 19:02:15,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-06 19:02:15,686 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-06 19:02:15,686 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-06 19:02:15,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-06 19:02:15,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-06 19:02:15,688 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-06 19:02:15,688 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-06 19:02:15,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-06 19:02:15,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-06 19:02:15,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-06 19:02:15,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-06 19:02:15,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-06 19:02:15,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-06 19:02:15,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-06 19:02:15,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-06 19:02:15,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-06 19:02:15,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-06 19:02:15,695 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 19:02:15,809 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-06 19:02:15,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-06 19:02:15,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-06 19:02:15,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-06 19:02:15,813 INFO L138 SettingsManager]: * Use SBE=true [2021-08-06 19:02:15,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-06 19:02:15,813 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-06 19:02:15,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-06 19:02:15,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-06 19:02:15,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-06 19:02:15,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-06 19:02:15,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-06 19:02:15,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-06 19:02:15,814 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-06 19:02:15,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-06 19:02:15,815 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-06 19:02:15,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-06 19:02:15,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-06 19:02:15,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-06 19:02:15,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-06 19:02:15,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-06 19:02:15,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 19:02:15,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-06 19:02:15,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-06 19:02:15,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-06 19:02:15,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-06 19:02:15,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-06 19:02:15,816 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-06 19:02:15,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-06 19:02:15,816 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-06 19:02:15,816 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 19:02:16,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-06 19:02:16,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-06 19:02:16,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-06 19:02:16,157 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-06 19:02:16,158 INFO L275 PluginConnector]: CDTParser initialized [2021-08-06 19:02:16,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2021-08-06 19:02:16,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88bcb054a/3777c492c0584f8fa517aba2d6bd6b82/FLAGd2e710007 [2021-08-06 19:02:16,687 INFO L306 CDTParser]: Found 1 translation units. [2021-08-06 19:02:16,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2021-08-06 19:02:16,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88bcb054a/3777c492c0584f8fa517aba2d6bd6b82/FLAGd2e710007 [2021-08-06 19:02:17,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88bcb054a/3777c492c0584f8fa517aba2d6bd6b82 [2021-08-06 19:02:17,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-06 19:02:17,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-06 19:02:17,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-06 19:02:17,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-06 19:02:17,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-06 19:02:17,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37977a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17, skipping insertion in model container [2021-08-06 19:02:17,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-06 19:02:17,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-06 19:02:17,387 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/safe001_power.opt.i[951,964] [2021-08-06 19:02:17,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 19:02:17,540 INFO L203 MainTranslator]: Completed pre-run [2021-08-06 19:02:17,547 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/safe001_power.opt.i[951,964] [2021-08-06 19:02:17,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 19:02:17,605 INFO L208 MainTranslator]: Completed translation [2021-08-06 19:02:17,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17 WrapperNode [2021-08-06 19:02:17,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-06 19:02:17,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-06 19:02:17,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-06 19:02:17,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-06 19:02:17,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-06 19:02:17,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-06 19:02:17,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-06 19:02:17,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-06 19:02:17,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-06 19:02:17,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-06 19:02:17,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-06 19:02:17,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-06 19:02:17,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17" (1/1) ... [2021-08-06 19:02:17,667 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 19:02:17,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-06 19:02:17,679 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 19:02:17,696 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 19:02:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-06 19:02:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-06 19:02:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-06 19:02:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-06 19:02:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-06 19:02:17,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-06 19:02:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-06 19:02:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-06 19:02:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-06 19:02:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-06 19:02:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-06 19:02:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-06 19:02:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-06 19:02:17,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-06 19:02:17,720 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 19:02:19,313 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-06 19:02:19,313 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-06 19:02:19,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 07:02:19 BoogieIcfgContainer [2021-08-06 19:02:19,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-06 19:02:19,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-06 19:02:19,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-06 19:02:19,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-06 19:02:19,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 07:02:17" (1/3) ... [2021-08-06 19:02:19,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573a915e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 07:02:19, skipping insertion in model container [2021-08-06 19:02:19,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:02:17" (2/3) ... [2021-08-06 19:02:19,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@573a915e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 07:02:19, skipping insertion in model container [2021-08-06 19:02:19,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 07:02:19" (3/3) ... [2021-08-06 19:02:19,323 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_power.opt.i [2021-08-06 19:02:19,326 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-06 19:02:19,327 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-06 19:02:19,327 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-06 19:02:19,327 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-06 19:02:19,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,354 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,354 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,354 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,354 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,359 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,360 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,362 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,362 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,362 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,362 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,368 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,368 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,370 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,370 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,370 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,372 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,373 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:02:19,374 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-06 19:02:19,404 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-08-06 19:02:19,408 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 19:02:19,408 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-06 19:02:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 9815 states, 8572 states have (on average 2.22690153989734) internal successors, (19089), 9814 states have internal predecessors, (19089), 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 19:02:20,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-06 19:02:20,615 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:20,616 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] [2021-08-06 19:02:20,616 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 19:02:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:20,620 INFO L82 PathProgramCache]: Analyzing trace with hash 907583695, now seen corresponding path program 1 times [2021-08-06 19:02:20,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:20,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845608191] [2021-08-06 19:02:20,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:20,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:02:20,999 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 19:02:21,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:02:21,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845608191] [2021-08-06 19:02:21,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845608191] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:02:21,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:02:21,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 19:02:21,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279616812] [2021-08-06 19:02:21,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 19:02:21,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:02:21,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 19:02:21,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 19:02:21,032 INFO L87 Difference]: Start difference. First operand has 9815 states, 8572 states have (on average 2.22690153989734) internal successors, (19089), 9814 states have internal predecessors, (19089), 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.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 19:02:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:02:21,290 INFO L93 Difference]: Finished difference Result 11255 states and 22445 transitions. [2021-08-06 19:02:21,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 19:02:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 67 [2021-08-06 19:02:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:02:21,335 INFO L225 Difference]: With dead ends: 11255 [2021-08-06 19:02:21,336 INFO L226 Difference]: Without dead ends: 4951 [2021-08-06 19:02:21,337 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 109.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:02:21,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2021-08-06 19:02:21,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4951. [2021-08-06 19:02:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4951 states, 4879 states have (on average 2.476327116212339) internal successors, (12082), 4950 states have internal predecessors, (12082), 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 19:02:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4951 states to 4951 states and 12082 transitions. [2021-08-06 19:02:21,576 INFO L78 Accepts]: Start accepts. Automaton has 4951 states and 12082 transitions. Word has length 67 [2021-08-06 19:02:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:02:21,577 INFO L470 AbstractCegarLoop]: Abstraction has 4951 states and 12082 transitions. [2021-08-06 19:02:21,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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 19:02:21,578 INFO L276 IsEmpty]: Start isEmpty. Operand 4951 states and 12082 transitions. [2021-08-06 19:02:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-06 19:02:21,584 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:21,584 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 19:02:21,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-06 19:02:21,585 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 19:02:21,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:21,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1692508112, now seen corresponding path program 1 times [2021-08-06 19:02:21,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:21,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664584450] [2021-08-06 19:02:21,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:21,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:02:21,786 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 19:02:21,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:02:21,786 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664584450] [2021-08-06 19:02:21,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664584450] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:02:21,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:02:21,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 19:02:21,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214592593] [2021-08-06 19:02:21,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 19:02:21,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:02:21,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 19:02:21,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 19:02:21,790 INFO L87 Difference]: Start difference. First operand 4951 states and 12082 transitions. 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 19:02:21,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:02:21,896 INFO L93 Difference]: Finished difference Result 5635 states and 14298 transitions. [2021-08-06 19:02:21,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 19:02:21,896 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 19:02:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:02:21,914 INFO L225 Difference]: With dead ends: 5635 [2021-08-06 19:02:21,915 INFO L226 Difference]: Without dead ends: 4028 [2021-08-06 19:02:21,916 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 59.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:02:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4028 states. [2021-08-06 19:02:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4028 to 4028. [2021-08-06 19:02:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4028 states, 3974 states have (on average 2.5035228988424763) internal successors, (9949), 4027 states have internal predecessors, (9949), 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 19:02:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 9949 transitions. [2021-08-06 19:02:22,004 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 9949 transitions. Word has length 69 [2021-08-06 19:02:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:02:22,005 INFO L470 AbstractCegarLoop]: Abstraction has 4028 states and 9949 transitions. [2021-08-06 19:02:22,005 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 19:02:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 9949 transitions. [2021-08-06 19:02:22,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-06 19:02:22,046 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:22,046 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] [2021-08-06 19:02:22,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-06 19:02:22,046 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 19:02:22,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:22,046 INFO L82 PathProgramCache]: Analyzing trace with hash 85377201, now seen corresponding path program 1 times [2021-08-06 19:02:22,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:22,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220523641] [2021-08-06 19:02:22,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:22,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:02:22,177 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 85.4 percent of original size [2021-08-06 19:02:22,182 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 85.4 percent of original size [2021-08-06 19:02:22,246 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 19:02:22,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:02:22,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220523641] [2021-08-06 19:02:22,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220523641] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:02:22,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:02:22,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 19:02:22,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513623413] [2021-08-06 19:02:22,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 19:02:22,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:02:22,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 19:02:22,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-06 19:02:22,257 INFO L87 Difference]: Start difference. First operand 4028 states and 9949 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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 19:02:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:02:22,521 INFO L93 Difference]: Finished difference Result 4768 states and 12307 transitions. [2021-08-06 19:02:22,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 19:02:22,522 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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 71 [2021-08-06 19:02:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:02:22,535 INFO L225 Difference]: With dead ends: 4768 [2021-08-06 19:02:22,535 INFO L226 Difference]: Without dead ends: 3912 [2021-08-06 19:02:22,536 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 143.6ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-08-06 19:02:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3912 states. [2021-08-06 19:02:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3912 to 3912. [2021-08-06 19:02:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3912 states, 3858 states have (on average 2.4989631933644376) internal successors, (9641), 3911 states have internal predecessors, (9641), 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 19:02:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3912 states to 3912 states and 9641 transitions. [2021-08-06 19:02:22,633 INFO L78 Accepts]: Start accepts. Automaton has 3912 states and 9641 transitions. Word has length 71 [2021-08-06 19:02:22,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:02:22,633 INFO L470 AbstractCegarLoop]: Abstraction has 3912 states and 9641 transitions. [2021-08-06 19:02:22,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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 19:02:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3912 states and 9641 transitions. [2021-08-06 19:02:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-06 19:02:22,639 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:22,639 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] [2021-08-06 19:02:22,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-06 19:02:22,640 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 19:02:22,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:22,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1144585888, now seen corresponding path program 1 times [2021-08-06 19:02:22,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:22,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043438631] [2021-08-06 19:02:22,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:22,641 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:02:22,739 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 19:02:22,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:02:22,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043438631] [2021-08-06 19:02:22,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043438631] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:02:22,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:02:22,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 19:02:22,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283825854] [2021-08-06 19:02:22,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 19:02:22,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:02:22,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 19:02:22,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-06 19:02:22,741 INFO L87 Difference]: Start difference. First operand 3912 states and 9641 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 19:02:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:02:22,863 INFO L93 Difference]: Finished difference Result 5084 states and 12955 transitions. [2021-08-06 19:02:22,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 19:02:22,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 72 [2021-08-06 19:02:22,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:02:22,872 INFO L225 Difference]: With dead ends: 5084 [2021-08-06 19:02:22,872 INFO L226 Difference]: Without dead ends: 2391 [2021-08-06 19:02:22,873 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 84.5ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-06 19:02:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2021-08-06 19:02:22,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2021-08-06 19:02:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2391 states, 2361 states have (on average 2.519695044472681) internal successors, (5949), 2390 states have internal predecessors, (5949), 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 19:02:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 5949 transitions. [2021-08-06 19:02:22,913 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 5949 transitions. Word has length 72 [2021-08-06 19:02:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:02:22,913 INFO L470 AbstractCegarLoop]: Abstraction has 2391 states and 5949 transitions. [2021-08-06 19:02:22,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 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 19:02:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 5949 transitions. [2021-08-06 19:02:22,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 19:02:22,918 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:22,918 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 19:02:22,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-06 19:02:22,918 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 19:02:22,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:22,919 INFO L82 PathProgramCache]: Analyzing trace with hash 323703319, now seen corresponding path program 1 times [2021-08-06 19:02:22,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:22,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753436512] [2021-08-06 19:02:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:22,919 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:02:23,032 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 19:02:23,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:02:23,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753436512] [2021-08-06 19:02:23,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753436512] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:02:23,033 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:02:23,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 19:02:23,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377943603] [2021-08-06 19:02:23,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 19:02:23,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:02:23,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 19:02:23,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-06 19:02:23,034 INFO L87 Difference]: Start difference. First operand 2391 states and 5949 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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 19:02:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:02:23,107 INFO L93 Difference]: Finished difference Result 4123 states and 10448 transitions. [2021-08-06 19:02:23,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-06 19:02:23,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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 19:02:23,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:02:23,116 INFO L225 Difference]: With dead ends: 4123 [2021-08-06 19:02:23,116 INFO L226 Difference]: Without dead ends: 2265 [2021-08-06 19:02:23,116 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 50.1ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:02:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2021-08-06 19:02:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2265. [2021-08-06 19:02:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2235 states have (on average 2.5651006711409394) internal successors, (5733), 2264 states have internal predecessors, (5733), 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 19:02:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 5733 transitions. [2021-08-06 19:02:23,146 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 5733 transitions. Word has length 75 [2021-08-06 19:02:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:02:23,146 INFO L470 AbstractCegarLoop]: Abstraction has 2265 states and 5733 transitions. [2021-08-06 19:02:23,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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 19:02:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 5733 transitions. [2021-08-06 19:02:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 19:02:23,149 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:23,149 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 19:02:23,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-06 19:02:23,150 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 19:02:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:23,150 INFO L82 PathProgramCache]: Analyzing trace with hash 459979586, now seen corresponding path program 1 times [2021-08-06 19:02:23,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:23,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820714641] [2021-08-06 19:02:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:23,150 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:02:23,233 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 19:02:23,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:02:23,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820714641] [2021-08-06 19:02:23,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820714641] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:02:23,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:02:23,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 19:02:23,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514780555] [2021-08-06 19:02:23,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 19:02:23,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:02:23,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 19:02:23,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-06 19:02:23,234 INFO L87 Difference]: Start difference. First operand 2265 states and 5733 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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 19:02:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:02:23,336 INFO L93 Difference]: Finished difference Result 3193 states and 8346 transitions. [2021-08-06 19:02:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 19:02:23,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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 19:02:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:02:23,354 INFO L225 Difference]: With dead ends: 3193 [2021-08-06 19:02:23,354 INFO L226 Difference]: Without dead ends: 1461 [2021-08-06 19:02:23,354 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 73.9ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-06 19:02:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2021-08-06 19:02:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1461. [2021-08-06 19:02:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1431 states have (on average 2.678546470999301) internal successors, (3833), 1460 states have internal predecessors, (3833), 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 19:02:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 3833 transitions. [2021-08-06 19:02:23,375 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 3833 transitions. Word has length 75 [2021-08-06 19:02:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:02:23,376 INFO L470 AbstractCegarLoop]: Abstraction has 1461 states and 3833 transitions. [2021-08-06 19:02:23,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 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 19:02:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 3833 transitions. [2021-08-06 19:02:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-06 19:02:23,381 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:23,381 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 19:02:23,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-06 19:02:23,382 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 19:02:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1515257998, now seen corresponding path program 1 times [2021-08-06 19:02:23,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:23,382 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165459153] [2021-08-06 19:02:23,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:23,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:02:23,447 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:02:23,449 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:02:23,461 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 19:02:23,461 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:02:23,461 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165459153] [2021-08-06 19:02:23,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165459153] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:02:23,461 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:02:23,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 19:02:23,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149172625] [2021-08-06 19:02:23,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 19:02:23,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:02:23,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 19:02:23,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 19:02:23,463 INFO L87 Difference]: Start difference. First operand 1461 states and 3833 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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 19:02:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:02:23,533 INFO L93 Difference]: Finished difference Result 1709 states and 4291 transitions. [2021-08-06 19:02:23,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 19:02:23,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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 19:02:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:02:23,536 INFO L225 Difference]: With dead ends: 1709 [2021-08-06 19:02:23,536 INFO L226 Difference]: Without dead ends: 1245 [2021-08-06 19:02:23,537 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 49.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:02:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2021-08-06 19:02:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1245. [2021-08-06 19:02:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 1215 states have (on average 2.6378600823045266) internal successors, (3205), 1244 states have internal predecessors, (3205), 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 19:02:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 3205 transitions. [2021-08-06 19:02:23,555 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 3205 transitions. Word has length 76 [2021-08-06 19:02:23,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:02:23,555 INFO L470 AbstractCegarLoop]: Abstraction has 1245 states and 3205 transitions. [2021-08-06 19:02:23,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 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 19:02:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 3205 transitions. [2021-08-06 19:02:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 19:02:23,557 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:23,557 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 19:02:23,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-06 19:02:23,557 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 19:02:23,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:23,558 INFO L82 PathProgramCache]: Analyzing trace with hash -235442199, now seen corresponding path program 1 times [2021-08-06 19:02:23,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:23,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582395413] [2021-08-06 19:02:23,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:23,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:02:23,653 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:02:23,654 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:02:23,667 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 19:02:23,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:02:23,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582395413] [2021-08-06 19:02:23,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582395413] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:02:23,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:02:23,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 19:02:23,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87878855] [2021-08-06 19:02:23,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 19:02:23,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:02:23,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 19:02:23,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 19:02:23,669 INFO L87 Difference]: Start difference. First operand 1245 states and 3205 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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 19:02:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:02:23,751 INFO L93 Difference]: Finished difference Result 1087 states and 2537 transitions. [2021-08-06 19:02:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 19:02:23,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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 19:02:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:02:23,753 INFO L225 Difference]: With dead ends: 1087 [2021-08-06 19:02:23,753 INFO L226 Difference]: Without dead ends: 716 [2021-08-06 19:02:23,753 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 59.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-06 19:02:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2021-08-06 19:02:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2021-08-06 19:02:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 692 states have (on average 2.393063583815029) internal successors, (1656), 715 states have internal predecessors, (1656), 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 19:02:23,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1656 transitions. [2021-08-06 19:02:23,763 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1656 transitions. Word has length 77 [2021-08-06 19:02:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:02:23,763 INFO L470 AbstractCegarLoop]: Abstraction has 716 states and 1656 transitions. [2021-08-06 19:02:23,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 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 19:02:23,764 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1656 transitions. [2021-08-06 19:02:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-06 19:02:23,765 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:23,765 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] [2021-08-06 19:02:23,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-06 19:02:23,765 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 19:02:23,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash 182875082, now seen corresponding path program 1 times [2021-08-06 19:02:23,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:23,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624220629] [2021-08-06 19:02:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:23,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:02:23,865 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:02:23,867 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:02:23,881 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 19:02:23,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:02:23,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624220629] [2021-08-06 19:02:23,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624220629] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:02:23,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:02:23,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 19:02:23,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776451725] [2021-08-06 19:02:23,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 19:02:23,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:02:23,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 19:02:23,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-06 19:02:23,882 INFO L87 Difference]: Start difference. First operand 716 states and 1656 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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 19:02:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:02:23,965 INFO L93 Difference]: Finished difference Result 458 states and 922 transitions. [2021-08-06 19:02:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 19:02:23,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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 79 [2021-08-06 19:02:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:02:23,966 INFO L225 Difference]: With dead ends: 458 [2021-08-06 19:02:23,966 INFO L226 Difference]: Without dead ends: 275 [2021-08-06 19:02:23,966 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 64.7ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-06 19:02:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-08-06 19:02:23,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-08-06 19:02:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 266 states have (on average 1.8796992481203008) internal successors, (500), 274 states have internal predecessors, (500), 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 19:02:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 500 transitions. [2021-08-06 19:02:23,969 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 500 transitions. Word has length 79 [2021-08-06 19:02:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:02:23,970 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 500 transitions. [2021-08-06 19:02:23,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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 19:02:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 500 transitions. [2021-08-06 19:02:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-06 19:02:23,970 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:23,970 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] [2021-08-06 19:02:23,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-06 19:02:23,971 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 19:02:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1565922012, now seen corresponding path program 1 times [2021-08-06 19:02:23,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:23,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157059428] [2021-08-06 19:02:23,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:23,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:02:24,140 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 87.3 percent of original size [2021-08-06 19:02:24,145 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 87.3 percent of original size [2021-08-06 19:02:24,197 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 19:02:24,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:02:24,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157059428] [2021-08-06 19:02:24,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157059428] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:02:24,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:02:24,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-06 19:02:24,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768020745] [2021-08-06 19:02:24,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-06 19:02:24,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:02:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-06 19:02:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:02:24,198 INFO L87 Difference]: Start difference. First operand 275 states and 500 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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 19:02:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:02:24,339 INFO L93 Difference]: Finished difference Result 419 states and 810 transitions. [2021-08-06 19:02:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-06 19:02:24,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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 82 [2021-08-06 19:02:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:02:24,340 INFO L225 Difference]: With dead ends: 419 [2021-08-06 19:02:24,340 INFO L226 Difference]: Without dead ends: 296 [2021-08-06 19:02:24,340 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 117.8ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-08-06 19:02:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-08-06 19:02:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2021-08-06 19:02:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 262 states have (on average 1.8625954198473282) internal successors, (488), 270 states have internal predecessors, (488), 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 19:02:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 488 transitions. [2021-08-06 19:02:24,344 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 488 transitions. Word has length 82 [2021-08-06 19:02:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:02:24,345 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 488 transitions. [2021-08-06 19:02:24,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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 19:02:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 488 transitions. [2021-08-06 19:02:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-06 19:02:24,345 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:24,346 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] [2021-08-06 19:02:24,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-06 19:02:24,346 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 19:02:24,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1322652924, now seen corresponding path program 2 times [2021-08-06 19:02:24,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:24,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781497928] [2021-08-06 19:02:24,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:24,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:02:24,571 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 15, result has 81.9 percent of original size [2021-08-06 19:02:24,578 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 15, result has 81.9 percent of original size [2021-08-06 19:02:24,634 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 15, result has 82.8 percent of original size [2021-08-06 19:02:24,643 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 15, result has 82.8 percent of original size [2021-08-06 19:02:24,696 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 38, result has 64.8 percent of original size [2021-08-06 19:02:24,707 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 38, result has 64.8 percent of original size [2021-08-06 19:02:24,779 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 23, result has 58.2 percent of original size [2021-08-06 19:02:24,782 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 23, result has 58.2 percent of original size [2021-08-06 19:02:24,845 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 19:02:24,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:02:24,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781497928] [2021-08-06 19:02:24,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781497928] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:02:24,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:02:24,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-08-06 19:02:24,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732241861] [2021-08-06 19:02:24,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-06 19:02:24,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:02:24,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-06 19:02:24,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-08-06 19:02:24,847 INFO L87 Difference]: Start difference. First operand 271 states and 488 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 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 19:02:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:02:25,062 INFO L93 Difference]: Finished difference Result 565 states and 1099 transitions. [2021-08-06 19:02:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-06 19:02:25,062 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 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 82 [2021-08-06 19:02:25,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:02:25,063 INFO L225 Difference]: With dead ends: 565 [2021-08-06 19:02:25,063 INFO L226 Difference]: Without dead ends: 406 [2021-08-06 19:02:25,064 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 236.9ms TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2021-08-06 19:02:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-08-06 19:02:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 251. [2021-08-06 19:02:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 242 states have (on average 1.8677685950413223) internal successors, (452), 250 states have internal predecessors, (452), 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 19:02:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 452 transitions. [2021-08-06 19:02:25,068 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 452 transitions. Word has length 82 [2021-08-06 19:02:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:02:25,068 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 452 transitions. [2021-08-06 19:02:25,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 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 19:02:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 452 transitions. [2021-08-06 19:02:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-06 19:02:25,069 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:02:25,069 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] [2021-08-06 19:02:25,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-06 19:02:25,069 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 19:02:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:02:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1719176028, now seen corresponding path program 3 times [2021-08-06 19:02:25,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:02:25,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350673978] [2021-08-06 19:02:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:02:25,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:02:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 19:02:25,096 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-06 19:02:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 19:02:25,150 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-06 19:02:25,150 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-06 19:02:25,150 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 19:02:25,151 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-06 19:02:25,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-06 19:02:25,152 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-06 19:02:25,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-06 19:02:25,153 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2021-08-06 19:02:25,155 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-06 19:02:25,156 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-06 19:02:25,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 07:02:25 BasicIcfg [2021-08-06 19:02:25,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-06 19:02:25,264 INFO L168 Benchmark]: Toolchain (without parser) took 8067.53 ms. Allocated memory was 213.9 MB in the beginning and 805.3 MB in the end (delta: 591.4 MB). Free memory was 176.3 MB in the beginning and 488.4 MB in the end (delta: -312.2 MB). Peak memory consumption was 280.6 MB. Max. memory is 8.0 GB. [2021-08-06 19:02:25,268 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 213.9 MB. Free memory is still 194.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-06 19:02:25,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.50 ms. Allocated memory is still 213.9 MB. Free memory was 176.1 MB in the beginning and 183.5 MB in the end (delta: -7.4 MB). Peak memory consumption was 5.8 MB. Max. memory is 8.0 GB. [2021-08-06 19:02:25,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.51 ms. Allocated memory is still 213.9 MB. Free memory was 183.5 MB in the beginning and 180.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-06 19:02:25,268 INFO L168 Benchmark]: Boogie Preprocessor took 19.45 ms. Allocated memory is still 213.9 MB. Free memory was 180.7 MB in the beginning and 178.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-06 19:02:25,269 INFO L168 Benchmark]: RCFGBuilder took 1653.21 ms. Allocated memory was 213.9 MB in the beginning and 256.9 MB in the end (delta: 43.0 MB). Free memory was 178.3 MB in the beginning and 146.7 MB in the end (delta: 31.6 MB). Peak memory consumption was 103.6 MB. Max. memory is 8.0 GB. [2021-08-06 19:02:25,269 INFO L168 Benchmark]: TraceAbstraction took 5942.08 ms. Allocated memory was 256.9 MB in the beginning and 805.3 MB in the end (delta: 548.4 MB). Free memory was 146.1 MB in the beginning and 488.4 MB in the end (delta: -342.3 MB). Peak memory consumption was 205.6 MB. Max. memory is 8.0 GB. [2021-08-06 19:02:25,269 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.41 ms. Allocated memory is still 213.9 MB. Free memory is still 194.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 407.50 ms. Allocated memory is still 213.9 MB. Free memory was 176.1 MB in the beginning and 183.5 MB in the end (delta: -7.4 MB). Peak memory consumption was 5.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 36.51 ms. Allocated memory is still 213.9 MB. Free memory was 183.5 MB in the beginning and 180.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 19.45 ms. Allocated memory is still 213.9 MB. Free memory was 180.7 MB in the beginning and 178.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1653.21 ms. Allocated memory was 213.9 MB in the beginning and 256.9 MB in the end (delta: 43.0 MB). Free memory was 178.3 MB in the beginning and 146.7 MB in the end (delta: 31.6 MB). Peak memory consumption was 103.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5942.08 ms. Allocated memory was 256.9 MB in the beginning and 805.3 MB in the end (delta: 548.4 MB). Free memory was 146.1 MB in the beginning and 488.4 MB in the end (delta: -342.3 MB). Peak memory consumption was 205.6 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: 36237, positive: 33270, positive conditional: 33270, positive unconditional: 0, negative: 2967, negative conditional: 2967, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35604, positive: 33270, positive conditional: 0, positive unconditional: 33270, negative: 2334, negative conditional: 0, negative unconditional: 2334, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 863, positive: 815, positive conditional: 0, positive unconditional: 815, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 863, positive: 812, positive conditional: 0, positive unconditional: 812, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 481, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 477, negative conditional: 0, negative unconditional: 477, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35604, positive: 32455, positive conditional: 0, positive unconditional: 32455, negative: 2286, negative conditional: 0, negative unconditional: 2286, unknown: 863, unknown conditional: 0, unknown unconditional: 863] , Statistics on independence cache: Total cache size (in pairs): 863, Positive cache size: 815, Positive conditional cache size: 0, Positive unconditional cache size: 815, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Independence queries for same thread: 633 - 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L718] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L719] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L720] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L721] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L722] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L723] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L724] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L725] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L726] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L727] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] 0 pthread_t t1804; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1805; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1806; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 819]: 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: 823]: 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: 821]: 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: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5750.8ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 116.5ms, AutomataDifference: 1675.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1160.5ms, PartialOrderReductionTime: 1150.1ms, HoareTripleCheckerStatistics: 1307 SDtfs, 1760 SDslu, 4807 SDs, 0 SdLazy, 651 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 468.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1048.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9815occurred in iteration=0, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 545.0ms AutomataMinimizationTime, 11 MinimizatonAttempts, 180 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 36.1ms SsaConstructionTime, 440.8ms SatisfiabilityAnalysisTime, 1538.3ms InterpolantComputationTime, 907 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 814 ConstructedInterpolants, 0 QuantifiedInterpolants, 4082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 19:02:25,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...