/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/safe011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-8a14012e553caa636f65c1137831746b6d9875cd-8a14012 [2021-08-06 19:03:34,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-06 19:03:34,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-06 19:03:34,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-06 19:03:34,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-06 19:03:34,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-06 19:03:34,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-06 19:03:34,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-06 19:03:34,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-06 19:03:34,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-06 19:03:34,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-06 19:03:34,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-06 19:03:34,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-06 19:03:34,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-06 19:03:34,226 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-06 19:03:34,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-06 19:03:34,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-06 19:03:34,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-06 19:03:34,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-06 19:03:34,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-06 19:03:34,233 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-06 19:03:34,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-06 19:03:34,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-06 19:03:34,238 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-06 19:03:34,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-06 19:03:34,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-06 19:03:34,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-06 19:03:34,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-06 19:03:34,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-06 19:03:34,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-06 19:03:34,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-06 19:03:34,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-06 19:03:34,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-06 19:03:34,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-06 19:03:34,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-06 19:03:34,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-06 19:03:34,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-06 19:03:34,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-06 19:03:34,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-06 19:03:34,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-06 19:03:34,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-06 19:03:34,246 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:03:34,260 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-06 19:03:34,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-06 19:03:34,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-06 19:03:34,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-06 19:03:34,261 INFO L138 SettingsManager]: * Use SBE=true [2021-08-06 19:03:34,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-06 19:03:34,261 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-06 19:03:34,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-06 19:03:34,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-06 19:03:34,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-06 19:03:34,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-06 19:03:34,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-06 19:03:34,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-06 19:03:34,262 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-06 19:03:34,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-06 19:03:34,262 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-06 19:03:34,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-06 19:03:34,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-06 19:03:34,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-06 19:03:34,263 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-06 19:03:34,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-06 19:03:34,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 19:03:34,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-06 19:03:34,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-06 19:03:34,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-06 19:03:34,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-06 19:03:34,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-06 19:03:34,264 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-06 19:03:34,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-06 19:03:34,264 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-06 19:03:34,264 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:03:34,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-06 19:03:34,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-06 19:03:34,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-06 19:03:34,523 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-06 19:03:34,523 INFO L275 PluginConnector]: CDTParser initialized [2021-08-06 19:03:34,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2021-08-06 19:03:34,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e303b174/cf2916aa6b074ed1a92e2c3db51a89b8/FLAGaf993c208 [2021-08-06 19:03:34,995 INFO L306 CDTParser]: Found 1 translation units. [2021-08-06 19:03:34,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2021-08-06 19:03:35,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e303b174/cf2916aa6b074ed1a92e2c3db51a89b8/FLAGaf993c208 [2021-08-06 19:03:35,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e303b174/cf2916aa6b074ed1a92e2c3db51a89b8 [2021-08-06 19:03:35,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-06 19:03:35,033 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-06 19:03:35,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-06 19:03:35,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-06 19:03:35,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-06 19:03:35,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 07:03:35" (1/1) ... [2021-08-06 19:03:35,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7722c884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:03:35, skipping insertion in model container [2021-08-06 19:03:35,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 07:03:35" (1/1) ... [2021-08-06 19:03:35,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-06 19:03:35,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-06 19:03:35,248 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/safe011_rmo.oepc.i[950,963] [2021-08-06 19:03:35,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 19:03:35,402 INFO L203 MainTranslator]: Completed pre-run [2021-08-06 19:03:35,415 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/safe011_rmo.oepc.i[950,963] [2021-08-06 19:03:35,449 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 19:03:35,473 INFO L208 MainTranslator]: Completed translation [2021-08-06 19:03:35,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:03:35 WrapperNode [2021-08-06 19:03:35,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-06 19:03:35,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-06 19:03:35,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-06 19:03:35,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-06 19:03:35,479 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:03:35" (1/1) ... [2021-08-06 19:03:35,489 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:03:35" (1/1) ... [2021-08-06 19:03:35,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-06 19:03:35,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-06 19:03:35,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-06 19:03:35,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-06 19:03:35,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:03:35" (1/1) ... [2021-08-06 19:03:35,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:03:35" (1/1) ... [2021-08-06 19:03:35,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:03:35" (1/1) ... [2021-08-06 19:03:35,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:03:35" (1/1) ... [2021-08-06 19:03:35,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:03:35" (1/1) ... [2021-08-06 19:03:35,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:03:35" (1/1) ... [2021-08-06 19:03:35,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:03:35" (1/1) ... [2021-08-06 19:03:35,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-06 19:03:35,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-06 19:03:35,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-06 19:03:35,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-06 19:03:35,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:03:35" (1/1) ... [2021-08-06 19:03:35,567 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 19:03:35,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-06 19:03:35,581 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:03:35,583 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:03:35,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-06 19:03:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-06 19:03:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-06 19:03:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-06 19:03:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-06 19:03:35,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-06 19:03:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-06 19:03:35,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-06 19:03:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-06 19:03:35,608 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-06 19:03:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-06 19:03:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-06 19:03:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-06 19:03:35,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-06 19:03:35,609 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:03:37,070 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-06 19:03:37,070 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-06 19:03:37,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 07:03:37 BoogieIcfgContainer [2021-08-06 19:03:37,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-06 19:03:37,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-06 19:03:37,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-06 19:03:37,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-06 19:03:37,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 07:03:35" (1/3) ... [2021-08-06 19:03:37,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42383004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 07:03:37, skipping insertion in model container [2021-08-06 19:03:37,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 07:03:35" (2/3) ... [2021-08-06 19:03:37,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42383004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 07:03:37, skipping insertion in model container [2021-08-06 19:03:37,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 07:03:37" (3/3) ... [2021-08-06 19:03:37,078 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2021-08-06 19:03:37,081 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-06 19:03:37,081 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-06 19:03:37,081 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-06 19:03:37,081 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-06 19:03:37,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,106 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,106 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,106 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,106 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,106 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,106 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,110 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,110 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,111 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,111 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,113 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,113 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,114 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,114 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,118 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,119 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,126 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,126 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,127 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,127 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,130 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,130 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 19:03:37,132 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-06 19:03:37,159 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-08-06 19:03:37,162 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:03:37,162 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-06 19:03:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 9822 states, 8593 states have (on average 2.152333294542069) internal successors, (18495), 9821 states have internal predecessors, (18495), 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:03:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-06 19:03:38,237 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:38,238 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:03:38,238 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:03:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:38,242 INFO L82 PathProgramCache]: Analyzing trace with hash 136358668, now seen corresponding path program 1 times [2021-08-06 19:03:38,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:38,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422650783] [2021-08-06 19:03:38,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:38,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:38,582 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:03:38,583 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:38,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422650783] [2021-08-06 19:03:38,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422650783] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:38,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:38,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 19:03:38,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988611365] [2021-08-06 19:03:38,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 19:03:38,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:38,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 19:03:38,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 19:03:38,614 INFO L87 Difference]: Start difference. First operand has 9822 states, 8593 states have (on average 2.152333294542069) internal successors, (18495), 9821 states have internal predecessors, (18495), 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:03:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:38,786 INFO L93 Difference]: Finished difference Result 11262 states and 21894 transitions. [2021-08-06 19:03:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 19:03:38,788 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:03:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:38,820 INFO L225 Difference]: With dead ends: 11262 [2021-08-06 19:03:38,820 INFO L226 Difference]: Without dead ends: 4951 [2021-08-06 19:03:38,821 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 66.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:03:38,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2021-08-06 19:03:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4951. [2021-08-06 19:03:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4951 states, 4879 states have (on average 2.4170936667349867) internal successors, (11793), 4950 states have internal predecessors, (11793), 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:03:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4951 states to 4951 states and 11793 transitions. [2021-08-06 19:03:39,082 INFO L78 Accepts]: Start accepts. Automaton has 4951 states and 11793 transitions. Word has length 67 [2021-08-06 19:03:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:39,083 INFO L470 AbstractCegarLoop]: Abstraction has 4951 states and 11793 transitions. [2021-08-06 19:03:39,083 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:03:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4951 states and 11793 transitions. [2021-08-06 19:03:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-06 19:03:39,090 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:39,090 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:03:39,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-06 19:03:39,091 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:03:39,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash 217619213, now seen corresponding path program 1 times [2021-08-06 19:03:39,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:39,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407948937] [2021-08-06 19:03:39,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:39,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:39,318 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 23, result has 57.4 percent of original size [2021-08-06 19:03:39,332 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 23, result has 57.4 percent of original size [2021-08-06 19:03:39,397 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:03:39,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:39,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407948937] [2021-08-06 19:03:39,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407948937] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:39,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:39,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 19:03:39,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810363097] [2021-08-06 19:03:39,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 19:03:39,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:39,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 19:03:39,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-06 19:03:39,401 INFO L87 Difference]: Start difference. First operand 4951 states and 11793 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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:03:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:39,711 INFO L93 Difference]: Finished difference Result 5859 states and 14647 transitions. [2021-08-06 19:03:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 19:03:39,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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:03:39,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:39,730 INFO L225 Difference]: With dead ends: 5859 [2021-08-06 19:03:39,730 INFO L226 Difference]: Without dead ends: 4723 [2021-08-06 19:03:39,731 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 174.2ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-08-06 19:03:39,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4723 states. [2021-08-06 19:03:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4723 to 4723. [2021-08-06 19:03:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4723 states, 4651 states have (on average 2.40786927542464) internal successors, (11199), 4722 states have internal predecessors, (11199), 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:03:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 11199 transitions. [2021-08-06 19:03:39,840 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 11199 transitions. Word has length 69 [2021-08-06 19:03:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:39,841 INFO L470 AbstractCegarLoop]: Abstraction has 4723 states and 11199 transitions. [2021-08-06 19:03:39,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 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:03:39,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 11199 transitions. [2021-08-06 19:03:39,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-06 19:03:39,846 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:39,846 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] [2021-08-06 19:03:39,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-06 19:03:39,846 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:03:39,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:39,847 INFO L82 PathProgramCache]: Analyzing trace with hash -158154925, now seen corresponding path program 1 times [2021-08-06 19:03:39,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:39,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155131827] [2021-08-06 19:03:39,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:39,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:39,985 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:03:39,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:39,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155131827] [2021-08-06 19:03:39,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155131827] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:39,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:39,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 19:03:39,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542682833] [2021-08-06 19:03:39,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 19:03:39,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:39,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 19:03:39,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-06 19:03:39,991 INFO L87 Difference]: Start difference. First operand 4723 states and 11199 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:03:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:40,133 INFO L93 Difference]: Finished difference Result 6430 states and 15881 transitions. [2021-08-06 19:03:40,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 19:03:40,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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 70 [2021-08-06 19:03:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:40,147 INFO L225 Difference]: With dead ends: 6430 [2021-08-06 19:03:40,147 INFO L226 Difference]: Without dead ends: 3226 [2021-08-06 19:03:40,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 103.5ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-06 19:03:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2021-08-06 19:03:40,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3226. [2021-08-06 19:03:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3226 states, 3181 states have (on average 2.483495756051556) internal successors, (7900), 3225 states have internal predecessors, (7900), 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:03:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3226 states to 3226 states and 7900 transitions. [2021-08-06 19:03:40,239 INFO L78 Accepts]: Start accepts. Automaton has 3226 states and 7900 transitions. Word has length 70 [2021-08-06 19:03:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:40,239 INFO L470 AbstractCegarLoop]: Abstraction has 3226 states and 7900 transitions. [2021-08-06 19:03:40,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 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:03:40,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3226 states and 7900 transitions. [2021-08-06 19:03:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-06 19:03:40,245 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:40,246 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 19:03:40,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-06 19:03:40,246 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:03:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1075891407, now seen corresponding path program 1 times [2021-08-06 19:03:40,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:40,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867289440] [2021-08-06 19:03:40,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:40,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:40,462 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 34, result has 46.0 percent of original size [2021-08-06 19:03:40,466 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 34, result has 46.0 percent of original size [2021-08-06 19:03:40,492 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 23, result has 57.4 percent of original size [2021-08-06 19:03:40,496 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 23, result has 57.4 percent of original size [2021-08-06 19:03:40,562 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:03:40,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:40,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867289440] [2021-08-06 19:03:40,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867289440] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:40,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:40,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 19:03:40,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770119100] [2021-08-06 19:03:40,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 19:03:40,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 19:03:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-06 19:03:40,563 INFO L87 Difference]: Start difference. First operand 3226 states and 7900 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 19:03:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:40,831 INFO L93 Difference]: Finished difference Result 3798 states and 9514 transitions. [2021-08-06 19:03:40,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-06 19:03:40,832 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-06 19:03:40,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:40,843 INFO L225 Difference]: With dead ends: 3798 [2021-08-06 19:03:40,843 INFO L226 Difference]: Without dead ends: 3238 [2021-08-06 19:03:40,844 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 179.6ms TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-08-06 19:03:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2021-08-06 19:03:40,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 3166. [2021-08-06 19:03:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3166 states, 3121 states have (on average 2.4716437039410444) internal successors, (7714), 3165 states have internal predecessors, (7714), 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:03:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 3166 states and 7714 transitions. [2021-08-06 19:03:40,911 INFO L78 Accepts]: Start accepts. Automaton has 3166 states and 7714 transitions. Word has length 73 [2021-08-06 19:03:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:40,911 INFO L470 AbstractCegarLoop]: Abstraction has 3166 states and 7714 transitions. [2021-08-06 19:03:40,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 19:03:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 7714 transitions. [2021-08-06 19:03:40,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-06 19:03:40,916 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:40,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 19:03:40,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-06 19:03:40,916 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:03:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:40,917 INFO L82 PathProgramCache]: Analyzing trace with hash 771354867, now seen corresponding path program 1 times [2021-08-06 19:03:40,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:40,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116286845] [2021-08-06 19:03:40,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:40,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:41,029 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 23, result has 54.9 percent of original size [2021-08-06 19:03:41,032 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 23, result has 54.9 percent of original size [2021-08-06 19:03:41,046 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 23, result has 57.4 percent of original size [2021-08-06 19:03:41,051 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 23, result has 57.4 percent of original size [2021-08-06 19:03:41,103 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:03:41,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:41,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116286845] [2021-08-06 19:03:41,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116286845] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:41,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:41,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-06 19:03:41,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019212696] [2021-08-06 19:03:41,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-06 19:03:41,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:41,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-06 19:03:41,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-06 19:03:41,104 INFO L87 Difference]: Start difference. First operand 3166 states and 7714 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 19:03:41,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:41,457 INFO L93 Difference]: Finished difference Result 3537 states and 8820 transitions. [2021-08-06 19:03:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-06 19:03:41,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-06 19:03:41,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:41,469 INFO L225 Difference]: With dead ends: 3537 [2021-08-06 19:03:41,469 INFO L226 Difference]: Without dead ends: 3025 [2021-08-06 19:03:41,470 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 195.2ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-08-06 19:03:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3025 states. [2021-08-06 19:03:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3025 to 2977. [2021-08-06 19:03:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2937 states have (on average 2.4453524004085803) internal successors, (7182), 2976 states have internal predecessors, (7182), 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:03:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 7182 transitions. [2021-08-06 19:03:41,523 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 7182 transitions. Word has length 73 [2021-08-06 19:03:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:41,523 INFO L470 AbstractCegarLoop]: Abstraction has 2977 states and 7182 transitions. [2021-08-06 19:03:41,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 19:03:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 7182 transitions. [2021-08-06 19:03:41,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-06 19:03:41,527 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:41,527 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 19:03:41,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-06 19:03:41,527 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:03:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:41,528 INFO L82 PathProgramCache]: Analyzing trace with hash -248743483, now seen corresponding path program 2 times [2021-08-06 19:03:41,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:41,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974686518] [2021-08-06 19:03:41,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:41,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:41,595 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 14, result has 84.8 percent of original size [2021-08-06 19:03:41,600 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 14, result has 84.8 percent of original size [2021-08-06 19:03:41,651 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:03:41,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:41,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974686518] [2021-08-06 19:03:41,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974686518] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:41,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:41,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 19:03:41,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083208806] [2021-08-06 19:03:41,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 19:03:41,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 19:03:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-06 19:03:41,653 INFO L87 Difference]: Start difference. First operand 2977 states and 7182 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 19:03:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:41,937 INFO L93 Difference]: Finished difference Result 3533 states and 8796 transitions. [2021-08-06 19:03:41,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-06 19:03:41,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-06 19:03:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:41,945 INFO L225 Difference]: With dead ends: 3533 [2021-08-06 19:03:41,945 INFO L226 Difference]: Without dead ends: 3021 [2021-08-06 19:03:41,946 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 136.5ms TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2021-08-06 19:03:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2021-08-06 19:03:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2991. [2021-08-06 19:03:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2951 states have (on average 2.4442561843442903) internal successors, (7213), 2990 states have internal predecessors, (7213), 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:03:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 7213 transitions. [2021-08-06 19:03:42,000 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 7213 transitions. Word has length 73 [2021-08-06 19:03:42,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:42,000 INFO L470 AbstractCegarLoop]: Abstraction has 2991 states and 7213 transitions. [2021-08-06 19:03:42,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 19:03:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 7213 transitions. [2021-08-06 19:03:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-06 19:03:42,003 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:42,004 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] [2021-08-06 19:03:42,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-06 19:03:42,004 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:03:42,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:42,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1202273625, now seen corresponding path program 1 times [2021-08-06 19:03:42,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:42,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241389346] [2021-08-06 19:03:42,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:42,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:42,122 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 15, result has 75.4 percent of original size [2021-08-06 19:03:42,130 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 15, result has 75.4 percent of original size [2021-08-06 19:03:42,153 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 15, result has 76.6 percent of original size [2021-08-06 19:03:42,156 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 15, result has 76.6 percent of original size [2021-08-06 19:03:42,269 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:03:42,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:42,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241389346] [2021-08-06 19:03:42,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241389346] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:42,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:42,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-06 19:03:42,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642185515] [2021-08-06 19:03:42,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-06 19:03:42,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:42,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-06 19:03:42,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-06 19:03:42,270 INFO L87 Difference]: Start difference. First operand 2991 states and 7213 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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:03:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:42,674 INFO L93 Difference]: Finished difference Result 3327 states and 8185 transitions. [2021-08-06 19:03:42,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-06 19:03:42,675 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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 74 [2021-08-06 19:03:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:42,681 INFO L225 Difference]: With dead ends: 3327 [2021-08-06 19:03:42,682 INFO L226 Difference]: Without dead ends: 2943 [2021-08-06 19:03:42,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 297.1ms TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2021-08-06 19:03:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2021-08-06 19:03:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2907. [2021-08-06 19:03:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2907 states, 2867 states have (on average 2.427973491454482) internal successors, (6961), 2906 states have internal predecessors, (6961), 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:03:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2907 states to 2907 states and 6961 transitions. [2021-08-06 19:03:42,726 INFO L78 Accepts]: Start accepts. Automaton has 2907 states and 6961 transitions. Word has length 74 [2021-08-06 19:03:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:42,726 INFO L470 AbstractCegarLoop]: Abstraction has 2907 states and 6961 transitions. [2021-08-06 19:03:42,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 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:03:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2907 states and 6961 transitions. [2021-08-06 19:03:42,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-06 19:03:42,730 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:42,730 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] [2021-08-06 19:03:42,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-06 19:03:42,730 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:03:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:42,731 INFO L82 PathProgramCache]: Analyzing trace with hash 715284846, now seen corresponding path program 1 times [2021-08-06 19:03:42,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:42,731 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722799286] [2021-08-06 19:03:42,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:42,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:42,814 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 87.0 percent of original size [2021-08-06 19:03:42,821 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 87.0 percent of original size [2021-08-06 19:03:42,842 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 87.7 percent of original size [2021-08-06 19:03:42,849 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 87.7 percent of original size [2021-08-06 19:03:42,879 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 127, result has 21.6 percent of original size [2021-08-06 19:03:42,895 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 127, result has 21.6 percent of original size [2021-08-06 19:03:42,961 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:03:42,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:42,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722799286] [2021-08-06 19:03:42,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722799286] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:42,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:42,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 19:03:42,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985167807] [2021-08-06 19:03:42,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 19:03:42,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:42,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 19:03:42,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-06 19:03:42,962 INFO L87 Difference]: Start difference. First operand 2907 states and 6961 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 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:03:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:43,261 INFO L93 Difference]: Finished difference Result 3087 states and 7521 transitions. [2021-08-06 19:03:43,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 19:03:43,262 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 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 74 [2021-08-06 19:03:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:43,267 INFO L225 Difference]: With dead ends: 3087 [2021-08-06 19:03:43,267 INFO L226 Difference]: Without dead ends: 2543 [2021-08-06 19:03:43,267 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 215.9ms TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-08-06 19:03:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2021-08-06 19:03:43,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2543. [2021-08-06 19:03:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2543 states, 2513 states have (on average 2.472741742936729) internal successors, (6214), 2542 states have internal predecessors, (6214), 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:03:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2543 states to 2543 states and 6214 transitions. [2021-08-06 19:03:43,305 INFO L78 Accepts]: Start accepts. Automaton has 2543 states and 6214 transitions. Word has length 74 [2021-08-06 19:03:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:43,305 INFO L470 AbstractCegarLoop]: Abstraction has 2543 states and 6214 transitions. [2021-08-06 19:03:43,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 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:03:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 6214 transitions. [2021-08-06 19:03:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 19:03:43,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:43,309 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:03:43,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-06 19:03:43,309 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:03:43,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash -855520079, now seen corresponding path program 1 times [2021-08-06 19:03:43,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:43,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390175488] [2021-08-06 19:03:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:43,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:43,435 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 87.0 percent of original size [2021-08-06 19:03:43,444 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 87.0 percent of original size [2021-08-06 19:03:43,472 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 87.7 percent of original size [2021-08-06 19:03:43,476 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 87.7 percent of original size [2021-08-06 19:03:43,508 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 87.0 percent of original size [2021-08-06 19:03:43,512 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 87.0 percent of original size [2021-08-06 19:03:43,578 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:03:43,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:43,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390175488] [2021-08-06 19:03:43,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390175488] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:43,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:43,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-06 19:03:43,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738925955] [2021-08-06 19:03:43,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-06 19:03:43,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:43,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-06 19:03:43,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-06 19:03:43,580 INFO L87 Difference]: Start difference. First operand 2543 states and 6214 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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:03:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:43,824 INFO L93 Difference]: Finished difference Result 2879 states and 7226 transitions. [2021-08-06 19:03:43,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 19:03:43,825 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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:03:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:43,830 INFO L225 Difference]: With dead ends: 2879 [2021-08-06 19:03:43,831 INFO L226 Difference]: Without dead ends: 2495 [2021-08-06 19:03:43,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 188.3ms TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2021-08-06 19:03:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2021-08-06 19:03:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2399. [2021-08-06 19:03:43,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 2369 states have (on average 2.4558885605740817) internal successors, (5818), 2398 states have internal predecessors, (5818), 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:03:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 5818 transitions. [2021-08-06 19:03:43,875 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 5818 transitions. Word has length 75 [2021-08-06 19:03:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:43,875 INFO L470 AbstractCegarLoop]: Abstraction has 2399 states and 5818 transitions. [2021-08-06 19:03:43,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 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:03:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 5818 transitions. [2021-08-06 19:03:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 19:03:43,879 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:43,879 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:03:43,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-06 19:03:43,879 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:03:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1160056619, now seen corresponding path program 1 times [2021-08-06 19:03:43,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:43,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770817625] [2021-08-06 19:03:43,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:43,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:43,934 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:03:43,936 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 85.4 percent of original size [2021-08-06 19:03:43,944 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 19:03:43,946 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 19:03:43,966 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 87.0 percent of original size [2021-08-06 19:03:43,969 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 87.0 percent of original size [2021-08-06 19:03:44,018 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:03:44,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:44,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770817625] [2021-08-06 19:03:44,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770817625] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:44,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:44,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-06 19:03:44,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183420091] [2021-08-06 19:03:44,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-06 19:03:44,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:44,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-06 19:03:44,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-06 19:03:44,020 INFO L87 Difference]: Start difference. First operand 2399 states and 5818 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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:03:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:44,254 INFO L93 Difference]: Finished difference Result 3189 states and 8305 transitions. [2021-08-06 19:03:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-06 19:03:44,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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:03:44,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:44,262 INFO L225 Difference]: With dead ends: 3189 [2021-08-06 19:03:44,262 INFO L226 Difference]: Without dead ends: 2717 [2021-08-06 19:03:44,263 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 129.8ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-08-06 19:03:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2021-08-06 19:03:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2547. [2021-08-06 19:03:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2547 states, 2517 states have (on average 2.499006754072308) internal successors, (6290), 2546 states have internal predecessors, (6290), 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:03:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 6290 transitions. [2021-08-06 19:03:44,311 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 6290 transitions. Word has length 75 [2021-08-06 19:03:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:44,312 INFO L470 AbstractCegarLoop]: Abstraction has 2547 states and 6290 transitions. [2021-08-06 19:03:44,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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:03:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 6290 transitions. [2021-08-06 19:03:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 19:03:44,315 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:44,315 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:03:44,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-06 19:03:44,316 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:03:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:44,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1768240985, now seen corresponding path program 2 times [2021-08-06 19:03:44,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:44,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890513205] [2021-08-06 19:03:44,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:44,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:44,387 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 84.4 percent of original size [2021-08-06 19:03:44,389 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 84.4 percent of original size [2021-08-06 19:03:44,396 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:03:44,398 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 85.4 percent of original size [2021-08-06 19:03:44,412 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 19:03:44,415 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 19:03:44,463 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:03:44,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:44,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890513205] [2021-08-06 19:03:44,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890513205] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:44,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:44,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 19:03:44,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560811249] [2021-08-06 19:03:44,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 19:03:44,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:44,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 19:03:44,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-06 19:03:44,469 INFO L87 Difference]: Start difference. First operand 2547 states and 6290 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:03:44,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:44,686 INFO L93 Difference]: Finished difference Result 3226 states and 8331 transitions. [2021-08-06 19:03:44,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 19:03:44,693 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:03:44,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:44,700 INFO L225 Difference]: With dead ends: 3226 [2021-08-06 19:03:44,700 INFO L226 Difference]: Without dead ends: 2834 [2021-08-06 19:03:44,701 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 95.1ms TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2021-08-06 19:03:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2021-08-06 19:03:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2558. [2021-08-06 19:03:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2528 states have (on average 2.5011867088607596) internal successors, (6323), 2557 states have internal predecessors, (6323), 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:03:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 6323 transitions. [2021-08-06 19:03:44,741 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 6323 transitions. Word has length 75 [2021-08-06 19:03:44,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:44,741 INFO L470 AbstractCegarLoop]: Abstraction has 2558 states and 6323 transitions. [2021-08-06 19:03:44,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:03:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 6323 transitions. [2021-08-06 19:03:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-06 19:03:44,745 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:44,745 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:03:44,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-06 19:03:44,745 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:03:44,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:44,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1460220423, now seen corresponding path program 3 times [2021-08-06 19:03:44,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:44,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772711485] [2021-08-06 19:03:44,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:44,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:44,857 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 19:03:44,859 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 86.3 percent of original size [2021-08-06 19:03:44,877 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 7, result has 88.7 percent of original size [2021-08-06 19:03:44,880 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 7, result has 88.7 percent of original size [2021-08-06 19:03:44,951 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:03:44,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:44,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772711485] [2021-08-06 19:03:44,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772711485] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:44,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:44,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-06 19:03:44,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144536669] [2021-08-06 19:03:44,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-06 19:03:44,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:44,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-06 19:03:44,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:03:44,953 INFO L87 Difference]: Start difference. First operand 2558 states and 6323 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 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:03:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:45,222 INFO L93 Difference]: Finished difference Result 3026 states and 7726 transitions. [2021-08-06 19:03:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 19:03:45,223 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 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:03:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:45,228 INFO L225 Difference]: With dead ends: 3026 [2021-08-06 19:03:45,228 INFO L226 Difference]: Without dead ends: 2634 [2021-08-06 19:03:45,228 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 133.5ms TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-08-06 19:03:45,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2021-08-06 19:03:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2551. [2021-08-06 19:03:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2521 states have (on average 2.4946449821499406) internal successors, (6289), 2550 states have internal predecessors, (6289), 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:03:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 6289 transitions. [2021-08-06 19:03:45,259 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 6289 transitions. Word has length 75 [2021-08-06 19:03:45,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:45,259 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 6289 transitions. [2021-08-06 19:03:45,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 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:03:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 6289 transitions. [2021-08-06 19:03:45,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-06 19:03:45,263 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:45,263 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:03:45,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-06 19:03:45,263 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:03:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:45,263 INFO L82 PathProgramCache]: Analyzing trace with hash -735147030, now seen corresponding path program 1 times [2021-08-06 19:03:45,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:45,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273713565] [2021-08-06 19:03:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:45,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:45,318 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:03:45,319 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:03:45,329 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:03:45,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:45,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273713565] [2021-08-06 19:03:45,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273713565] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:45,329 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:45,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 19:03:45,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311135564] [2021-08-06 19:03:45,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 19:03:45,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:45,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 19:03:45,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 19:03:45,330 INFO L87 Difference]: Start difference. First operand 2551 states and 6289 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:03:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:45,405 INFO L93 Difference]: Finished difference Result 3139 states and 7369 transitions. [2021-08-06 19:03:45,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 19:03:45,405 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:03:45,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:45,409 INFO L225 Difference]: With dead ends: 3139 [2021-08-06 19:03:45,409 INFO L226 Difference]: Without dead ends: 2131 [2021-08-06 19:03:45,409 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 52.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 19:03:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2131 states. [2021-08-06 19:03:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2131 to 2131. [2021-08-06 19:03:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 2101 states have (on average 2.4688243693479297) internal successors, (5187), 2130 states have internal predecessors, (5187), 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:03:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 5187 transitions. [2021-08-06 19:03:45,438 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 5187 transitions. Word has length 76 [2021-08-06 19:03:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:45,439 INFO L470 AbstractCegarLoop]: Abstraction has 2131 states and 5187 transitions. [2021-08-06 19:03:45,439 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:03:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 5187 transitions. [2021-08-06 19:03:45,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 19:03:45,442 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:45,442 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:03:45,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-06 19:03:45,442 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:03:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash -480541582, now seen corresponding path program 1 times [2021-08-06 19:03:45,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:45,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604387836] [2021-08-06 19:03:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:45,443 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:45,504 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:03:45,505 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:03:45,515 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:03:45,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:45,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604387836] [2021-08-06 19:03:45,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604387836] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:45,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:45,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 19:03:45,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474548376] [2021-08-06 19:03:45,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 19:03:45,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:45,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 19:03:45,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 19:03:45,516 INFO L87 Difference]: Start difference. First operand 2131 states and 5187 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:03:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:45,613 INFO L93 Difference]: Finished difference Result 1907 states and 4243 transitions. [2021-08-06 19:03:45,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 19:03:45,613 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:03:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:45,615 INFO L225 Difference]: With dead ends: 1907 [2021-08-06 19:03:45,615 INFO L226 Difference]: Without dead ends: 1123 [2021-08-06 19:03:45,616 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 63.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-06 19:03:45,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2021-08-06 19:03:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1115. [2021-08-06 19:03:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1091 states have (on average 2.303391384051329) internal successors, (2513), 1114 states have internal predecessors, (2513), 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:03:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 2513 transitions. [2021-08-06 19:03:45,630 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 2513 transitions. Word has length 77 [2021-08-06 19:03:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:45,630 INFO L470 AbstractCegarLoop]: Abstraction has 1115 states and 2513 transitions. [2021-08-06 19:03:45,630 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:03:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 2513 transitions. [2021-08-06 19:03:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-06 19:03:45,632 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:45,632 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:03:45,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-06 19:03:45,632 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:03:45,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash 958019381, now seen corresponding path program 1 times [2021-08-06 19:03:45,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:45,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711974331] [2021-08-06 19:03:45,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:45,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:45,707 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:03:45,708 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 10, result has 47.4 percent of original size [2021-08-06 19:03:45,718 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:03:45,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:45,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711974331] [2021-08-06 19:03:45,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711974331] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:45,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:45,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 19:03:45,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559074793] [2021-08-06 19:03:45,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 19:03:45,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:45,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 19:03:45,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-06 19:03:45,720 INFO L87 Difference]: Start difference. First operand 1115 states and 2513 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:03:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:45,815 INFO L93 Difference]: Finished difference Result 725 states and 1428 transitions. [2021-08-06 19:03:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 19:03:45,816 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:03:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:45,817 INFO L225 Difference]: With dead ends: 725 [2021-08-06 19:03:45,817 INFO L226 Difference]: Without dead ends: 399 [2021-08-06 19:03:45,818 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 76.0ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-06 19:03:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-08-06 19:03:45,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 387. [2021-08-06 19:03:45,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 378 states have (on average 1.806878306878307) internal successors, (683), 386 states have internal predecessors, (683), 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:03:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 683 transitions. [2021-08-06 19:03:45,822 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 683 transitions. Word has length 79 [2021-08-06 19:03:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:45,822 INFO L470 AbstractCegarLoop]: Abstraction has 387 states and 683 transitions. [2021-08-06 19:03:45,823 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:03:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 683 transitions. [2021-08-06 19:03:45,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-06 19:03:45,823 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:45,823 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:03:45,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-06 19:03:45,824 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:03:45,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:45,824 INFO L82 PathProgramCache]: Analyzing trace with hash 813039822, now seen corresponding path program 1 times [2021-08-06 19:03:45,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:45,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779298291] [2021-08-06 19:03:45,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:45,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 19:03:45,935 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 6, result has 82.4 percent of original size [2021-08-06 19:03:45,938 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 6, result has 82.4 percent of original size [2021-08-06 19:03:46,032 WARN L248 tifierPushTermWalker]: Quantifier elimination called on non-simplified input: treesize reduction 34, result has 49.3 percent of original size [2021-08-06 19:03:46,035 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 34, result has 49.3 percent of original size [2021-08-06 19:03:46,057 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:03:46,060 WARN L260 tifierPushTermWalker]: Quantifier elimination failed to simlify output: treesize reduction 23, result has 58.2 percent of original size [2021-08-06 19:03:46,125 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:03:46,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 19:03:46,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779298291] [2021-08-06 19:03:46,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779298291] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 19:03:46,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 19:03:46,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-06 19:03:46,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883683056] [2021-08-06 19:03:46,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-06 19:03:46,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 19:03:46,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-06 19:03:46,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-08-06 19:03:46,128 INFO L87 Difference]: Start difference. First operand 387 states and 683 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 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:03:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 19:03:46,397 INFO L93 Difference]: Finished difference Result 526 states and 984 transitions. [2021-08-06 19:03:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-06 19:03:46,397 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 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:03:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 19:03:46,398 INFO L225 Difference]: With dead ends: 526 [2021-08-06 19:03:46,398 INFO L226 Difference]: Without dead ends: 315 [2021-08-06 19:03:46,398 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 224.4ms TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-08-06 19:03:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-08-06 19:03:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2021-08-06 19:03:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 306 states have (on average 1.8398692810457515) internal successors, (563), 314 states have internal predecessors, (563), 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:03:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 563 transitions. [2021-08-06 19:03:46,401 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 563 transitions. Word has length 82 [2021-08-06 19:03:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 19:03:46,401 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 563 transitions. [2021-08-06 19:03:46,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 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:03:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 563 transitions. [2021-08-06 19:03:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-06 19:03:46,402 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 19:03:46,402 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:03:46,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-06 19:03:46,402 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 19:03:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 19:03:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash -473656532, now seen corresponding path program 2 times [2021-08-06 19:03:46,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 19:03:46,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351592094] [2021-08-06 19:03:46,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 19:03:46,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 19:03:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 19:03:46,430 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-06 19:03:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 19:03:46,481 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-06 19:03:46,481 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-06 19:03:46,482 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 19:03:46,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-06 19:03:46,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-06 19:03:46,483 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-06 19:03:46,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-06 19:03:46,485 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2021-08-06 19:03:46,487 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-06 19:03:46,487 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-06 19:03:46,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 07:03:46 BasicIcfg [2021-08-06 19:03:46,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-06 19:03:46,575 INFO L168 Benchmark]: Toolchain (without parser) took 11542.31 ms. Allocated memory was 204.5 MB in the beginning and 709.9 MB in the end (delta: 505.4 MB). Free memory was 167.1 MB in the beginning and 520.0 MB in the end (delta: -352.9 MB). Peak memory consumption was 154.0 MB. Max. memory is 8.0 GB. [2021-08-06 19:03:46,575 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 204.5 MB. Free memory is still 185.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-06 19:03:46,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.96 ms. Allocated memory is still 204.5 MB. Free memory was 166.9 MB in the beginning and 173.8 MB in the end (delta: -6.9 MB). Peak memory consumption was 12.2 MB. Max. memory is 8.0 GB. [2021-08-06 19:03:46,576 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.18 ms. Allocated memory is still 204.5 MB. Free memory was 173.8 MB in the beginning and 170.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-06 19:03:46,576 INFO L168 Benchmark]: Boogie Preprocessor took 43.92 ms. Allocated memory is still 204.5 MB. Free memory was 170.6 MB in the beginning and 168.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-06 19:03:46,576 INFO L168 Benchmark]: RCFGBuilder took 1512.62 ms. Allocated memory is still 204.5 MB. Free memory was 168.5 MB in the beginning and 171.0 MB in the end (delta: -2.5 MB). Peak memory consumption was 109.8 MB. Max. memory is 8.0 GB. [2021-08-06 19:03:46,576 INFO L168 Benchmark]: TraceAbstraction took 9501.65 ms. Allocated memory was 204.5 MB in the beginning and 709.9 MB in the end (delta: 505.4 MB). Free memory was 170.5 MB in the beginning and 520.0 MB in the end (delta: -349.5 MB). Peak memory consumption was 155.9 MB. Max. memory is 8.0 GB. [2021-08-06 19:03:46,576 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.44 ms. Allocated memory is still 204.5 MB. Free memory is still 185.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 437.96 ms. Allocated memory is still 204.5 MB. Free memory was 166.9 MB in the beginning and 173.8 MB in the end (delta: -6.9 MB). Peak memory consumption was 12.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 40.18 ms. Allocated memory is still 204.5 MB. Free memory was 173.8 MB in the beginning and 170.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 43.92 ms. Allocated memory is still 204.5 MB. Free memory was 170.6 MB in the beginning and 168.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1512.62 ms. Allocated memory is still 204.5 MB. Free memory was 168.5 MB in the beginning and 171.0 MB in the end (delta: -2.5 MB). Peak memory consumption was 109.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9501.65 ms. Allocated memory was 204.5 MB in the beginning and 709.9 MB in the end (delta: 505.4 MB). Free memory was 170.5 MB in the beginning and 520.0 MB in the end (delta: -349.5 MB). Peak memory consumption was 155.9 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: 35612, positive: 33000, positive conditional: 33000, positive unconditional: 0, negative: 2612, negative conditional: 2612, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35111, positive: 33000, positive conditional: 0, positive unconditional: 33000, negative: 2111, negative conditional: 0, negative unconditional: 2111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 874, positive: 832, positive conditional: 0, positive unconditional: 832, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 874, positive: 829, positive conditional: 0, positive unconditional: 829, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 503, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 499, negative conditional: 0, negative unconditional: 499, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35111, positive: 32168, positive conditional: 0, positive unconditional: 32168, negative: 2069, negative conditional: 0, negative unconditional: 2069, unknown: 874, unknown conditional: 0, unknown unconditional: 874] , Statistics on independence cache: Total cache size (in pairs): 874, Positive cache size: 832, Positive conditional cache size: 0, Positive unconditional cache size: 832, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Independence queries for same thread: 501 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2037; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2038; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK 0 pthread_create(&t2038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2039; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=1, __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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=1, __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, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __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, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __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, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __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, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __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=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __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=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __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=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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. - 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. - 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: 9327.3ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 135.3ms, AutomataDifference: 3934.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 994.1ms, PartialOrderReductionTime: 984.4ms, HoareTripleCheckerStatistics: 1921 SDtfs, 3595 SDslu, 8080 SDs, 0 SdLazy, 1602 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1435.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 2332.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9822occurred in iteration=0, InterpolantAutomatonStates: 201, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 920.4ms AutomataMinimizationTime, 16 MinimizatonAttempts, 831 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 47.7ms SsaConstructionTime, 461.9ms SatisfiabilityAnalysisTime, 2578.5ms InterpolantComputationTime, 1269 NumberOfCodeBlocks, 1269 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1171 ConstructedInterpolants, 0 QuantifiedInterpolants, 7655 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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:03:46,606 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...