/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-8a14012e553caa636f65c1137831746b6d9875cd-8a14012 [2021-08-06 13:50:28,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-06 13:50:28,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-06 13:50:28,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-06 13:50:28,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-06 13:50:28,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-06 13:50:28,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-06 13:50:28,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-06 13:50:28,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-06 13:50:28,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-06 13:50:28,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-06 13:50:28,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-06 13:50:28,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-06 13:50:28,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-06 13:50:28,400 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-06 13:50:28,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-06 13:50:28,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-06 13:50:28,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-06 13:50:28,408 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-06 13:50:28,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-06 13:50:28,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-06 13:50:28,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-06 13:50:28,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-06 13:50:28,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-06 13:50:28,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-06 13:50:28,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-06 13:50:28,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-06 13:50:28,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-06 13:50:28,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-06 13:50:28,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-06 13:50:28,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-06 13:50:28,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-06 13:50:28,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-06 13:50:28,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-06 13:50:28,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-06 13:50:28,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-06 13:50:28,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-06 13:50:28,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-06 13:50:28,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-06 13:50:28,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-06 13:50:28,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-06 13:50:28,426 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.epf [2021-08-06 13:50:28,686 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-06 13:50:28,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-06 13:50:28,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-06 13:50:28,687 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-06 13:50:28,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-06 13:50:28,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-06 13:50:28,688 INFO L138 SettingsManager]: * Use SBE=true [2021-08-06 13:50:28,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-06 13:50:28,688 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-06 13:50:28,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-06 13:50:28,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-06 13:50:28,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-06 13:50:28,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-06 13:50:28,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-06 13:50:28,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-06 13:50:28,690 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-06 13:50:28,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-06 13:50:28,690 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-06 13:50:28,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-06 13:50:28,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-06 13:50:28,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-06 13:50:28,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-06 13:50:28,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-06 13:50:28,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:50:28,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-06 13:50:28,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-06 13:50:28,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-06 13:50:28,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-06 13:50:28,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-06 13:50:28,692 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-06 13:50:28,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-06 13:50:28,693 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 13:50:29,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-06 13:50:29,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-06 13:50:29,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-06 13:50:29,047 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-06 13:50:29,047 INFO L275 PluginConnector]: CDTParser initialized [2021-08-06 13:50:29,048 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_pso.oepc.i [2021-08-06 13:50:29,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc00a99b/65c4f000f1444275ab64b743354e2485/FLAG9deccad29 [2021-08-06 13:50:29,621 INFO L306 CDTParser]: Found 1 translation units. [2021-08-06 13:50:29,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_pso.oepc.i [2021-08-06 13:50:29,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc00a99b/65c4f000f1444275ab64b743354e2485/FLAG9deccad29 [2021-08-06 13:50:29,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bc00a99b/65c4f000f1444275ab64b743354e2485 [2021-08-06 13:50:29,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-06 13:50:29,927 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-06 13:50:29,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-06 13:50:29,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-06 13:50:29,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-06 13:50:29,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:50:29" (1/1) ... [2021-08-06 13:50:29,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41702c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:29, skipping insertion in model container [2021-08-06 13:50:29,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:50:29" (1/1) ... [2021-08-06 13:50:29,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-06 13:50:29,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-06 13:50:30,107 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/safe023_pso.oepc.i[993,1006] [2021-08-06 13:50:30,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:50:30,391 INFO L203 MainTranslator]: Completed pre-run [2021-08-06 13:50:30,430 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/safe023_pso.oepc.i[993,1006] [2021-08-06 13:50:30,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:50:30,526 INFO L208 MainTranslator]: Completed translation [2021-08-06 13:50:30,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30 WrapperNode [2021-08-06 13:50:30,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-06 13:50:30,527 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-06 13:50:30,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-06 13:50:30,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-06 13:50:30,533 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30" (1/1) ... [2021-08-06 13:50:30,568 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30" (1/1) ... [2021-08-06 13:50:30,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-06 13:50:30,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-06 13:50:30,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-06 13:50:30,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-06 13:50:30,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30" (1/1) ... [2021-08-06 13:50:30,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30" (1/1) ... [2021-08-06 13:50:30,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30" (1/1) ... [2021-08-06 13:50:30,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30" (1/1) ... [2021-08-06 13:50:30,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30" (1/1) ... [2021-08-06 13:50:30,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30" (1/1) ... [2021-08-06 13:50:30,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30" (1/1) ... [2021-08-06 13:50:30,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-06 13:50:30,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-06 13:50:30,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-06 13:50:30,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-06 13:50:30,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30" (1/1) ... [2021-08-06 13:50:30,690 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:50:30,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-06 13:50:30,710 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 13:50:30,726 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 13:50:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-06 13:50:30,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-06 13:50:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-06 13:50:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-06 13:50:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-06 13:50:30,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-06 13:50:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-06 13:50:30,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-06 13:50:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-06 13:50:30,765 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-06 13:50:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-06 13:50:30,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-06 13:50:30,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-06 13:50:30,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-06 13:50:30,768 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 13:50:33,904 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-06 13:50:33,905 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-06 13:50:33,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:50:33 BoogieIcfgContainer [2021-08-06 13:50:33,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-06 13:50:33,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-06 13:50:33,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-06 13:50:33,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-06 13:50:33,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 01:50:29" (1/3) ... [2021-08-06 13:50:33,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f5a552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:50:33, skipping insertion in model container [2021-08-06 13:50:33,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:50:30" (2/3) ... [2021-08-06 13:50:33,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f5a552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:50:33, skipping insertion in model container [2021-08-06 13:50:33,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:50:33" (3/3) ... [2021-08-06 13:50:33,915 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_pso.oepc.i [2021-08-06 13:50:33,920 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-06 13:50:33,920 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-06 13:50:33,920 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-06 13:50:33,921 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-06 13:50:33,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,968 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,968 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,968 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,968 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,992 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,993 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,994 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,995 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,995 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,995 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,995 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,995 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,995 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,996 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,996 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,999 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,999 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,999 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,999 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:33,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,021 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,027 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,027 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,029 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,032 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,033 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,039 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,039 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,039 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,040 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:50:34,041 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-06 13:50:34,077 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-08-06 13:50:34,082 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 13:50:34,083 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-06 13:50:34,093 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 108 transitions, 231 flow [2021-08-06 13:50:34,423 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 11038 states, 11036 states have (on average 3.5888002899601306) internal successors, (39606), 11037 states have internal predecessors, (39606), 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 13:50:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 11038 states, 11036 states have (on average 3.5888002899601306) internal successors, (39606), 11037 states have internal predecessors, (39606), 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 13:50:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-06 13:50:34,496 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:34,497 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] [2021-08-06 13:50:34,498 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 13:50:34,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:34,502 INFO L82 PathProgramCache]: Analyzing trace with hash 80787783, now seen corresponding path program 1 times [2021-08-06 13:50:34,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:34,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584184647] [2021-08-06 13:50:34,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:34,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:35,060 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 13:50:35,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:35,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584184647] [2021-08-06 13:50:35,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584184647] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:35,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:35,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:50:35,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938599563] [2021-08-06 13:50:35,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:50:35,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:35,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:50:35,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:50:35,111 INFO L87 Difference]: Start difference. First operand has 11038 states, 11036 states have (on average 3.5888002899601306) internal successors, (39606), 11037 states have internal predecessors, (39606), 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.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 13:50:35,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:35,393 INFO L93 Difference]: Finished difference Result 12658 states and 44268 transitions. [2021-08-06 13:50:35,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:50:35,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 68 [2021-08-06 13:50:35,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:35,483 INFO L225 Difference]: With dead ends: 12658 [2021-08-06 13:50:35,484 INFO L226 Difference]: Without dead ends: 9418 [2021-08-06 13:50:35,485 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 94.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:50:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9418 states. [2021-08-06 13:50:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9418 to 9418. [2021-08-06 13:50:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9418 states, 9416 states have (on average 3.49607051826678) internal successors, (32919), 9417 states have internal predecessors, (32919), 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 13:50:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9418 states to 9418 states and 32919 transitions. [2021-08-06 13:50:36,120 INFO L78 Accepts]: Start accepts. Automaton has 9418 states and 32919 transitions. Word has length 68 [2021-08-06 13:50:36,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:36,121 INFO L470 AbstractCegarLoop]: Abstraction has 9418 states and 32919 transitions. [2021-08-06 13:50:36,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 13:50:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 9418 states and 32919 transitions. [2021-08-06 13:50:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-06 13:50:36,141 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:36,141 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 13:50:36,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-06 13:50:36,141 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 13:50:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:36,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1422607162, now seen corresponding path program 1 times [2021-08-06 13:50:36,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:36,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916754334] [2021-08-06 13:50:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:36,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:36,469 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 13:50:36,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:36,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916754334] [2021-08-06 13:50:36,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916754334] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:36,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:36,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:50:36,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984794340] [2021-08-06 13:50:36,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:50:36,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:36,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:50:36,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:50:36,473 INFO L87 Difference]: Start difference. First operand 9418 states and 32919 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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 13:50:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:36,736 INFO L93 Difference]: Finished difference Result 10066 states and 34845 transitions. [2021-08-06 13:50:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:50:36,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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 13:50:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:36,806 INFO L225 Difference]: With dead ends: 10066 [2021-08-06 13:50:36,807 INFO L226 Difference]: Without dead ends: 8122 [2021-08-06 13:50:36,808 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 95.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:50:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2021-08-06 13:50:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 8122. [2021-08-06 13:50:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8122 states, 8120 states have (on average 3.459975369458128) internal successors, (28095), 8121 states have internal predecessors, (28095), 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 13:50:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8122 states to 8122 states and 28095 transitions. [2021-08-06 13:50:37,245 INFO L78 Accepts]: Start accepts. Automaton has 8122 states and 28095 transitions. Word has length 70 [2021-08-06 13:50:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:37,245 INFO L470 AbstractCegarLoop]: Abstraction has 8122 states and 28095 transitions. [2021-08-06 13:50:37,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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 13:50:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 8122 states and 28095 transitions. [2021-08-06 13:50:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-06 13:50:37,273 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:37,273 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 13:50:37,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-06 13:50:37,273 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 13:50:37,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:37,274 INFO L82 PathProgramCache]: Analyzing trace with hash -718976248, now seen corresponding path program 1 times [2021-08-06 13:50:37,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:37,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719047859] [2021-08-06 13:50:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:37,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:37,596 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 13:50:37,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:37,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719047859] [2021-08-06 13:50:37,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719047859] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:37,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:37,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:50:37,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574223435] [2021-08-06 13:50:37,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:50:37,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:50:37,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:50:37,599 INFO L87 Difference]: Start difference. First operand 8122 states and 28095 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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 13:50:37,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:37,829 INFO L93 Difference]: Finished difference Result 10912 states and 37572 transitions. [2021-08-06 13:50:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:50:37,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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 13:50:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:37,854 INFO L225 Difference]: With dead ends: 10912 [2021-08-06 13:50:37,854 INFO L226 Difference]: Without dead ends: 5233 [2021-08-06 13:50:37,855 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 163.2ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:50:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2021-08-06 13:50:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 5233. [2021-08-06 13:50:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 5232 states have (on average 3.3298929663608563) internal successors, (17422), 5232 states have internal predecessors, (17422), 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 13:50:38,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 17422 transitions. [2021-08-06 13:50:38,093 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 17422 transitions. Word has length 74 [2021-08-06 13:50:38,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:38,094 INFO L470 AbstractCegarLoop]: Abstraction has 5233 states and 17422 transitions. [2021-08-06 13:50:38,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 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 13:50:38,094 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 17422 transitions. [2021-08-06 13:50:38,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 13:50:38,108 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:38,108 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 13:50:38,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-06 13:50:38,109 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 13:50:38,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:38,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1313229512, now seen corresponding path program 1 times [2021-08-06 13:50:38,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:38,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063120857] [2021-08-06 13:50:38,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:38,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:38,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 13:50:38,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:38,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063120857] [2021-08-06 13:50:38,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063120857] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:38,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:38,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-06 13:50:38,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661698581] [2021-08-06 13:50:38,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-06 13:50:38,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:38,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-06 13:50:38,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-08-06 13:50:38,720 INFO L87 Difference]: Start difference. First operand 5233 states and 17422 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:39,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:39,451 INFO L93 Difference]: Finished difference Result 6250 states and 20744 transitions. [2021-08-06 13:50:39,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 13:50:39,453 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-06 13:50:39,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:39,477 INFO L225 Difference]: With dead ends: 6250 [2021-08-06 13:50:39,477 INFO L226 Difference]: Without dead ends: 5650 [2021-08-06 13:50:39,478 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 416.6ms TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2021-08-06 13:50:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5650 states. [2021-08-06 13:50:39,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5650 to 5650. [2021-08-06 13:50:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5650 states, 5649 states have (on average 3.333156310851478) internal successors, (18829), 5649 states have internal predecessors, (18829), 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 13:50:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5650 states to 5650 states and 18829 transitions. [2021-08-06 13:50:39,648 INFO L78 Accepts]: Start accepts. Automaton has 5650 states and 18829 transitions. Word has length 77 [2021-08-06 13:50:39,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:39,649 INFO L470 AbstractCegarLoop]: Abstraction has 5650 states and 18829 transitions. [2021-08-06 13:50:39,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5650 states and 18829 transitions. [2021-08-06 13:50:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 13:50:39,662 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:39,662 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 13:50:39,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-06 13:50:39,663 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 13:50:39,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:39,663 INFO L82 PathProgramCache]: Analyzing trace with hash -686679236, now seen corresponding path program 2 times [2021-08-06 13:50:39,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:39,664 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923600116] [2021-08-06 13:50:39,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:39,664 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:40,251 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 13:50:40,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:40,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923600116] [2021-08-06 13:50:40,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923600116] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:40,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:40,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-06 13:50:40,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820788412] [2021-08-06 13:50:40,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-06 13:50:40,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:40,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-06 13:50:40,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-06 13:50:40,253 INFO L87 Difference]: Start difference. First operand 5650 states and 18829 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:40,805 INFO L93 Difference]: Finished difference Result 6646 states and 22092 transitions. [2021-08-06 13:50:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 13:50:40,806 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-06 13:50:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:40,832 INFO L225 Difference]: With dead ends: 6646 [2021-08-06 13:50:40,832 INFO L226 Difference]: Without dead ends: 6046 [2021-08-06 13:50:40,833 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 317.5ms TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-08-06 13:50:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6046 states. [2021-08-06 13:50:40,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6046 to 5646. [2021-08-06 13:50:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5646 states, 5645 states have (on average 3.333746678476528) internal successors, (18819), 5645 states have internal predecessors, (18819), 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 13:50:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 18819 transitions. [2021-08-06 13:50:41,022 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 18819 transitions. Word has length 77 [2021-08-06 13:50:41,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:41,023 INFO L470 AbstractCegarLoop]: Abstraction has 5646 states and 18819 transitions. [2021-08-06 13:50:41,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 18819 transitions. [2021-08-06 13:50:41,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 13:50:41,037 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:41,037 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 13:50:41,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-06 13:50:41,037 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 13:50:41,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:41,038 INFO L82 PathProgramCache]: Analyzing trace with hash 188990618, now seen corresponding path program 3 times [2021-08-06 13:50:41,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:41,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140764989] [2021-08-06 13:50:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:41,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:41,505 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 13:50:41,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:41,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140764989] [2021-08-06 13:50:41,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140764989] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:41,506 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:41,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-06 13:50:41,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312701136] [2021-08-06 13:50:41,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-06 13:50:41,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:41,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-06 13:50:41,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-08-06 13:50:41,508 INFO L87 Difference]: Start difference. First operand 5646 states and 18819 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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 13:50:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:42,227 INFO L93 Difference]: Finished difference Result 9162 states and 30590 transitions. [2021-08-06 13:50:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-06 13:50:42,228 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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 13:50:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:42,260 INFO L225 Difference]: With dead ends: 9162 [2021-08-06 13:50:42,260 INFO L226 Difference]: Without dead ends: 8562 [2021-08-06 13:50:42,260 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 411.7ms TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2021-08-06 13:50:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8562 states. [2021-08-06 13:50:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8562 to 5646. [2021-08-06 13:50:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5646 states, 5645 states have (on average 3.333746678476528) internal successors, (18819), 5645 states have internal predecessors, (18819), 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 13:50:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 18819 transitions. [2021-08-06 13:50:42,464 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 18819 transitions. Word has length 77 [2021-08-06 13:50:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:42,464 INFO L470 AbstractCegarLoop]: Abstraction has 5646 states and 18819 transitions. [2021-08-06 13:50:42,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 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 13:50:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 18819 transitions. [2021-08-06 13:50:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-06 13:50:42,478 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:42,478 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 13:50:42,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-06 13:50:42,478 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 13:50:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1099751956, now seen corresponding path program 4 times [2021-08-06 13:50:42,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:42,479 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017833079] [2021-08-06 13:50:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:42,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:42,774 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 13:50:42,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:42,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017833079] [2021-08-06 13:50:42,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017833079] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:42,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:42,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:50:42,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288364756] [2021-08-06 13:50:42,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:50:42,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:42,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:50:42,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:50:42,777 INFO L87 Difference]: Start difference. First operand 5646 states and 18819 transitions. Second operand has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:43,246 INFO L93 Difference]: Finished difference Result 7137 states and 23844 transitions. [2021-08-06 13:50:43,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-06 13:50:43,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-06 13:50:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:43,271 INFO L225 Difference]: With dead ends: 7137 [2021-08-06 13:50:43,271 INFO L226 Difference]: Without dead ends: 6421 [2021-08-06 13:50:43,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 252.0ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-08-06 13:50:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6421 states. [2021-08-06 13:50:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6421 to 6001. [2021-08-06 13:50:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6001 states, 6000 states have (on average 3.341666666666667) internal successors, (20050), 6000 states have internal predecessors, (20050), 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 13:50:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6001 states to 6001 states and 20050 transitions. [2021-08-06 13:50:43,447 INFO L78 Accepts]: Start accepts. Automaton has 6001 states and 20050 transitions. Word has length 77 [2021-08-06 13:50:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:43,447 INFO L470 AbstractCegarLoop]: Abstraction has 6001 states and 20050 transitions. [2021-08-06 13:50:43,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6001 states and 20050 transitions. [2021-08-06 13:50:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-06 13:50:43,461 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:43,461 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:43,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-06 13:50:43,461 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 13:50:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:43,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1602195427, now seen corresponding path program 1 times [2021-08-06 13:50:43,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:43,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080799448] [2021-08-06 13:50:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:43,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:43,682 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 13:50:43,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:43,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080799448] [2021-08-06 13:50:43,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080799448] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:43,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:43,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-06 13:50:43,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767043840] [2021-08-06 13:50:43,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-06 13:50:43,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:43,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-06 13:50:43,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-06 13:50:43,684 INFO L87 Difference]: Start difference. First operand 6001 states and 20050 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:43,815 INFO L93 Difference]: Finished difference Result 7141 states and 23519 transitions. [2021-08-06 13:50:43,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-06 13:50:43,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-08-06 13:50:43,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:43,830 INFO L225 Difference]: With dead ends: 7141 [2021-08-06 13:50:43,830 INFO L226 Difference]: Without dead ends: 5197 [2021-08-06 13:50:43,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 76.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-06 13:50:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2021-08-06 13:50:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 5194. [2021-08-06 13:50:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5194 states, 5193 states have (on average 3.2649720777970344) internal successors, (16955), 5193 states have internal predecessors, (16955), 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 13:50:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 16955 transitions. [2021-08-06 13:50:43,983 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 16955 transitions. Word has length 78 [2021-08-06 13:50:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:43,984 INFO L470 AbstractCegarLoop]: Abstraction has 5194 states and 16955 transitions. [2021-08-06 13:50:43,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 16955 transitions. [2021-08-06 13:50:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-06 13:50:43,996 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:43,997 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 13:50:43,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-06 13:50:43,997 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 13:50:43,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1844587799, now seen corresponding path program 1 times [2021-08-06 13:50:43,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:43,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704763286] [2021-08-06 13:50:43,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:43,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:50:44,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:44,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704763286] [2021-08-06 13:50:44,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704763286] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:44,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:44,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-06 13:50:44,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236345877] [2021-08-06 13:50:44,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-06 13:50:44,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:44,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-06 13:50:44,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-06 13:50:44,136 INFO L87 Difference]: Start difference. First operand 5194 states and 16955 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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 13:50:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:44,281 INFO L93 Difference]: Finished difference Result 5098 states and 16234 transitions. [2021-08-06 13:50:44,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:50:44,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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 13:50:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:44,292 INFO L225 Difference]: With dead ends: 5098 [2021-08-06 13:50:44,292 INFO L226 Difference]: Without dead ends: 3646 [2021-08-06 13:50:44,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 91.1ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-06 13:50:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2021-08-06 13:50:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3355. [2021-08-06 13:50:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 3354 states have (on average 3.112701252236136) internal successors, (10440), 3354 states have internal predecessors, (10440), 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 13:50:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 10440 transitions. [2021-08-06 13:50:44,388 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 10440 transitions. Word has length 79 [2021-08-06 13:50:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:44,388 INFO L470 AbstractCegarLoop]: Abstraction has 3355 states and 10440 transitions. [2021-08-06 13:50:44,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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 13:50:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 10440 transitions. [2021-08-06 13:50:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-06 13:50:44,396 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:44,397 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:44,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-06 13:50:44,397 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 13:50:44,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash 120860904, now seen corresponding path program 1 times [2021-08-06 13:50:44,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:44,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067626671] [2021-08-06 13:50:44,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:44,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:44,675 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 13:50:44,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:44,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067626671] [2021-08-06 13:50:44,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067626671] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:44,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:44,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:50:44,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316847520] [2021-08-06 13:50:44,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:50:44,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:44,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:50:44,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:50:44,677 INFO L87 Difference]: Start difference. First operand 3355 states and 10440 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:45,039 INFO L93 Difference]: Finished difference Result 5476 states and 17064 transitions. [2021-08-06 13:50:45,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:50:45,039 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-08-06 13:50:45,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:45,050 INFO L225 Difference]: With dead ends: 5476 [2021-08-06 13:50:45,050 INFO L226 Difference]: Without dead ends: 3938 [2021-08-06 13:50:45,050 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 130.2ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-08-06 13:50:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2021-08-06 13:50:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3483. [2021-08-06 13:50:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3483 states, 3482 states have (on average 3.0947731188971854) internal successors, (10776), 3482 states have internal predecessors, (10776), 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 13:50:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 10776 transitions. [2021-08-06 13:50:45,160 INFO L78 Accepts]: Start accepts. Automaton has 3483 states and 10776 transitions. Word has length 81 [2021-08-06 13:50:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:45,160 INFO L470 AbstractCegarLoop]: Abstraction has 3483 states and 10776 transitions. [2021-08-06 13:50:45,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3483 states and 10776 transitions. [2021-08-06 13:50:45,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-06 13:50:45,169 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:45,169 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:45,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-06 13:50:45,170 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 13:50:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:45,170 INFO L82 PathProgramCache]: Analyzing trace with hash 403661066, now seen corresponding path program 2 times [2021-08-06 13:50:45,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:45,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153298591] [2021-08-06 13:50:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:45,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:45,355 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 13:50:45,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:45,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153298591] [2021-08-06 13:50:45,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153298591] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:45,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:45,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-06 13:50:45,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398095684] [2021-08-06 13:50:45,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-06 13:50:45,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:45,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-06 13:50:45,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-06 13:50:45,361 INFO L87 Difference]: Start difference. First operand 3483 states and 10776 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:45,510 INFO L93 Difference]: Finished difference Result 2961 states and 8973 transitions. [2021-08-06 13:50:45,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 13:50:45,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-08-06 13:50:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:45,517 INFO L225 Difference]: With dead ends: 2961 [2021-08-06 13:50:45,517 INFO L226 Difference]: Without dead ends: 2349 [2021-08-06 13:50:45,517 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 104.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-06 13:50:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2021-08-06 13:50:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2301. [2021-08-06 13:50:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2300 states have (on average 2.9756521739130433) internal successors, (6844), 2300 states have internal predecessors, (6844), 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 13:50:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 6844 transitions. [2021-08-06 13:50:45,576 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 6844 transitions. Word has length 81 [2021-08-06 13:50:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:45,576 INFO L470 AbstractCegarLoop]: Abstraction has 2301 states and 6844 transitions. [2021-08-06 13:50:45,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:50:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 6844 transitions. [2021-08-06 13:50:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:45,584 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:45,584 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:45,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-06 13:50:45,584 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 13:50:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash -400810022, now seen corresponding path program 1 times [2021-08-06 13:50:45,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:45,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335245124] [2021-08-06 13:50:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:45,585 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:45,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:46,064 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 13:50:46,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:46,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335245124] [2021-08-06 13:50:46,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335245124] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:46,065 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:46,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-06 13:50:46,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046465886] [2021-08-06 13:50:46,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-06 13:50:46,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:46,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-06 13:50:46,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:50:46,067 INFO L87 Difference]: Start difference. First operand 2301 states and 6844 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 13:50:46,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:46,475 INFO L93 Difference]: Finished difference Result 4161 states and 12599 transitions. [2021-08-06 13:50:46,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-06 13:50:46,475 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 84 [2021-08-06 13:50:46,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:46,483 INFO L225 Difference]: With dead ends: 4161 [2021-08-06 13:50:46,483 INFO L226 Difference]: Without dead ends: 2833 [2021-08-06 13:50:46,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 279.5ms TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-08-06 13:50:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2021-08-06 13:50:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2203. [2021-08-06 13:50:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 2202 states have (on average 2.9704813805631245) internal successors, (6541), 2202 states have internal predecessors, (6541), 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 13:50:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 6541 transitions. [2021-08-06 13:50:46,545 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 6541 transitions. Word has length 84 [2021-08-06 13:50:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:46,546 INFO L470 AbstractCegarLoop]: Abstraction has 2203 states and 6541 transitions. [2021-08-06 13:50:46,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 13:50:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 6541 transitions. [2021-08-06 13:50:46,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:46,551 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:46,552 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:46,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-06 13:50:46,552 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 13:50:46,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash 256589402, now seen corresponding path program 2 times [2021-08-06 13:50:46,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:46,553 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697400882] [2021-08-06 13:50:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:46,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:46,782 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 13:50:46,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:46,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697400882] [2021-08-06 13:50:46,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697400882] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:46,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:46,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-06 13:50:46,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141695199] [2021-08-06 13:50:46,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-06 13:50:46,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:46,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-06 13:50:46,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-06 13:50:46,784 INFO L87 Difference]: Start difference. First operand 2203 states and 6541 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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 13:50:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:47,018 INFO L93 Difference]: Finished difference Result 2952 states and 8809 transitions. [2021-08-06 13:50:47,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-06 13:50:47,018 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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 84 [2021-08-06 13:50:47,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:47,023 INFO L225 Difference]: With dead ends: 2952 [2021-08-06 13:50:47,023 INFO L226 Difference]: Without dead ends: 2232 [2021-08-06 13:50:47,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 114.4ms TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-08-06 13:50:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2232 states. [2021-08-06 13:50:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2232 to 2232. [2021-08-06 13:50:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 2231 states have (on average 2.965486329000448) internal successors, (6616), 2231 states have internal predecessors, (6616), 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 13:50:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 6616 transitions. [2021-08-06 13:50:47,078 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 6616 transitions. Word has length 84 [2021-08-06 13:50:47,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:47,078 INFO L470 AbstractCegarLoop]: Abstraction has 2232 states and 6616 transitions. [2021-08-06 13:50:47,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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 13:50:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 6616 transitions. [2021-08-06 13:50:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:47,083 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:47,084 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:47,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-06 13:50:47,084 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 13:50:47,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:47,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1797082036, now seen corresponding path program 3 times [2021-08-06 13:50:47,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:47,085 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376750203] [2021-08-06 13:50:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:47,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:47,483 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 13:50:47,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:47,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376750203] [2021-08-06 13:50:47,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376750203] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:47,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:47,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 13:50:47,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603923055] [2021-08-06 13:50:47,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 13:50:47,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:47,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 13:50:47,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-08-06 13:50:47,486 INFO L87 Difference]: Start difference. First operand 2232 states and 6616 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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 13:50:47,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:47,835 INFO L93 Difference]: Finished difference Result 2922 states and 8717 transitions. [2021-08-06 13:50:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:50:47,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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 84 [2021-08-06 13:50:47,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:47,840 INFO L225 Difference]: With dead ends: 2922 [2021-08-06 13:50:47,841 INFO L226 Difference]: Without dead ends: 2156 [2021-08-06 13:50:47,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 277.0ms TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-08-06 13:50:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2021-08-06 13:50:47,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1976. [2021-08-06 13:50:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1975 states have (on average 2.912405063291139) internal successors, (5752), 1975 states have internal predecessors, (5752), 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 13:50:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 5752 transitions. [2021-08-06 13:50:47,886 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 5752 transitions. Word has length 84 [2021-08-06 13:50:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:47,886 INFO L470 AbstractCegarLoop]: Abstraction has 1976 states and 5752 transitions. [2021-08-06 13:50:47,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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 13:50:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 5752 transitions. [2021-08-06 13:50:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:47,891 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:47,891 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:47,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-06 13:50:47,891 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 13:50:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:47,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1718298986, now seen corresponding path program 4 times [2021-08-06 13:50:47,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:47,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880876665] [2021-08-06 13:50:47,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:47,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:48,637 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 13:50:48,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:48,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880876665] [2021-08-06 13:50:48,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880876665] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:48,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:48,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-06 13:50:48,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443142358] [2021-08-06 13:50:48,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-06 13:50:48,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:48,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-06 13:50:48,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-08-06 13:50:48,639 INFO L87 Difference]: Start difference. First operand 1976 states and 5752 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 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 13:50:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:49,206 INFO L93 Difference]: Finished difference Result 3309 states and 9677 transitions. [2021-08-06 13:50:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-06 13:50:49,206 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 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 84 [2021-08-06 13:50:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:49,209 INFO L225 Difference]: With dead ends: 3309 [2021-08-06 13:50:49,210 INFO L226 Difference]: Without dead ends: 1947 [2021-08-06 13:50:49,210 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 476.4ms TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2021-08-06 13:50:49,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2021-08-06 13:50:49,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1947. [2021-08-06 13:50:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1947 states, 1946 states have (on average 2.910585817060637) internal successors, (5664), 1946 states have internal predecessors, (5664), 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 13:50:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 5664 transitions. [2021-08-06 13:50:49,242 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 5664 transitions. Word has length 84 [2021-08-06 13:50:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:49,242 INFO L470 AbstractCegarLoop]: Abstraction has 1947 states and 5664 transitions. [2021-08-06 13:50:49,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 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 13:50:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 5664 transitions. [2021-08-06 13:50:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:49,247 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:49,247 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:49,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-06 13:50:49,247 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 13:50:49,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:49,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2109550566, now seen corresponding path program 5 times [2021-08-06 13:50:49,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:49,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171817235] [2021-08-06 13:50:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:49,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:49,602 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 13:50:49,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:49,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171817235] [2021-08-06 13:50:49,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171817235] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:49,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:49,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-06 13:50:49,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339562288] [2021-08-06 13:50:49,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-06 13:50:49,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:49,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-06 13:50:49,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:50:49,605 INFO L87 Difference]: Start difference. First operand 1947 states and 5664 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 13:50:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:49,964 INFO L93 Difference]: Finished difference Result 2973 states and 8736 transitions. [2021-08-06 13:50:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 13:50:49,964 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 84 [2021-08-06 13:50:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:49,969 INFO L225 Difference]: With dead ends: 2973 [2021-08-06 13:50:49,969 INFO L226 Difference]: Without dead ends: 1945 [2021-08-06 13:50:49,970 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 159.6ms TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2021-08-06 13:50:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2021-08-06 13:50:50,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1873. [2021-08-06 13:50:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 2.9134615384615383) internal successors, (5454), 1872 states have internal predecessors, (5454), 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 13:50:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 5454 transitions. [2021-08-06 13:50:50,022 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 5454 transitions. Word has length 84 [2021-08-06 13:50:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:50,023 INFO L470 AbstractCegarLoop]: Abstraction has 1873 states and 5454 transitions. [2021-08-06 13:50:50,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 13:50:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 5454 transitions. [2021-08-06 13:50:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:50,026 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:50,026 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:50,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-06 13:50:50,027 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 13:50:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash 379783800, now seen corresponding path program 6 times [2021-08-06 13:50:50,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:50,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857587466] [2021-08-06 13:50:50,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:50,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:50,413 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 13:50:50,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:50,414 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857587466] [2021-08-06 13:50:50,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857587466] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:50,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:50,414 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-06 13:50:50,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234683979] [2021-08-06 13:50:50,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-06 13:50:50,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:50,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-06 13:50:50,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:50:50,416 INFO L87 Difference]: Start difference. First operand 1873 states and 5454 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 13:50:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:50,803 INFO L93 Difference]: Finished difference Result 2727 states and 7927 transitions. [2021-08-06 13:50:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 13:50:50,803 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 84 [2021-08-06 13:50:50,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:50,806 INFO L225 Difference]: With dead ends: 2727 [2021-08-06 13:50:50,806 INFO L226 Difference]: Without dead ends: 1716 [2021-08-06 13:50:50,806 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 250.2ms TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2021-08-06 13:50:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2021-08-06 13:50:50,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1716. [2021-08-06 13:50:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1715 states have (on average 2.926530612244898) internal successors, (5019), 1715 states have internal predecessors, (5019), 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 13:50:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 5019 transitions. [2021-08-06 13:50:50,828 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 5019 transitions. Word has length 84 [2021-08-06 13:50:50,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:50,828 INFO L470 AbstractCegarLoop]: Abstraction has 1716 states and 5019 transitions. [2021-08-06 13:50:50,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 13:50:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 5019 transitions. [2021-08-06 13:50:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:50,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:50,832 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:50,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-06 13:50:50,832 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:50:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:50,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1260532590, now seen corresponding path program 7 times [2021-08-06 13:50:50,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:50,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996251743] [2021-08-06 13:50:50,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:50,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:51,133 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 13:50:51,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:51,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996251743] [2021-08-06 13:50:51,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996251743] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:51,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:51,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-06 13:50:51,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421351273] [2021-08-06 13:50:51,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-06 13:50:51,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:51,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-06 13:50:51,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-08-06 13:50:51,136 INFO L87 Difference]: Start difference. First operand 1716 states and 5019 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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 13:50:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:51,685 INFO L93 Difference]: Finished difference Result 3610 states and 10791 transitions. [2021-08-06 13:50:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-06 13:50:51,686 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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 84 [2021-08-06 13:50:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:51,690 INFO L225 Difference]: With dead ends: 3610 [2021-08-06 13:50:51,690 INFO L226 Difference]: Without dead ends: 2338 [2021-08-06 13:50:51,691 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 365.0ms TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2021-08-06 13:50:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2021-08-06 13:50:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 1588. [2021-08-06 13:50:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1588 states, 1587 states have (on average 2.8834278512917453) internal successors, (4576), 1587 states have internal predecessors, (4576), 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 13:50:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1588 states to 1588 states and 4576 transitions. [2021-08-06 13:50:51,722 INFO L78 Accepts]: Start accepts. Automaton has 1588 states and 4576 transitions. Word has length 84 [2021-08-06 13:50:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:51,722 INFO L470 AbstractCegarLoop]: Abstraction has 1588 states and 4576 transitions. [2021-08-06 13:50:51,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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 13:50:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1588 states and 4576 transitions. [2021-08-06 13:50:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:51,725 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:51,725 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:51,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-06 13:50:51,725 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:50:51,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:51,726 INFO L82 PathProgramCache]: Analyzing trace with hash -59302956, now seen corresponding path program 8 times [2021-08-06 13:50:51,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:51,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753849867] [2021-08-06 13:50:51,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:51,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:51,908 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 13:50:51,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:51,909 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753849867] [2021-08-06 13:50:51,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753849867] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:51,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:51,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-06 13:50:51,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623582248] [2021-08-06 13:50:51,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-06 13:50:51,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:51,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-06 13:50:51,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-06 13:50:51,910 INFO L87 Difference]: Start difference. First operand 1588 states and 4576 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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 13:50:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:52,133 INFO L93 Difference]: Finished difference Result 2458 states and 7256 transitions. [2021-08-06 13:50:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-06 13:50:52,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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 84 [2021-08-06 13:50:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:52,136 INFO L225 Difference]: With dead ends: 2458 [2021-08-06 13:50:52,137 INFO L226 Difference]: Without dead ends: 1520 [2021-08-06 13:50:52,137 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 107.4ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-08-06 13:50:52,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2021-08-06 13:50:52,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1460. [2021-08-06 13:50:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1459 states have (on average 2.884167237834133) internal successors, (4208), 1459 states have internal predecessors, (4208), 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 13:50:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 4208 transitions. [2021-08-06 13:50:52,156 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 4208 transitions. Word has length 84 [2021-08-06 13:50:52,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:52,156 INFO L470 AbstractCegarLoop]: Abstraction has 1460 states and 4208 transitions. [2021-08-06 13:50:52,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 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 13:50:52,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 4208 transitions. [2021-08-06 13:50:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:52,158 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:52,159 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:52,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-06 13:50:52,159 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:50:52,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:52,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1991943498, now seen corresponding path program 9 times [2021-08-06 13:50:52,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:52,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783945548] [2021-08-06 13:50:52,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:52,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:52,473 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 13:50:52,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:52,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783945548] [2021-08-06 13:50:52,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783945548] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:52,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:52,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-06 13:50:52,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817811048] [2021-08-06 13:50:52,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-06 13:50:52,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:52,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-06 13:50:52,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-06 13:50:52,475 INFO L87 Difference]: Start difference. First operand 1460 states and 4208 transitions. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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 13:50:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:52,790 INFO L93 Difference]: Finished difference Result 3479 states and 10324 transitions. [2021-08-06 13:50:52,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-06 13:50:52,790 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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 84 [2021-08-06 13:50:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:52,794 INFO L225 Difference]: With dead ends: 3479 [2021-08-06 13:50:52,794 INFO L226 Difference]: Without dead ends: 2129 [2021-08-06 13:50:52,795 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 184.4ms TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2021-08-06 13:50:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2021-08-06 13:50:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1445. [2021-08-06 13:50:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 2.8760387811634347) internal successors, (4153), 1444 states have internal predecessors, (4153), 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 13:50:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 4153 transitions. [2021-08-06 13:50:52,813 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 4153 transitions. Word has length 84 [2021-08-06 13:50:52,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:52,814 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 4153 transitions. [2021-08-06 13:50:52,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 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 13:50:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 4153 transitions. [2021-08-06 13:50:52,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:52,816 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:52,816 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:52,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-06 13:50:52,817 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:50:52,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:52,817 INFO L82 PathProgramCache]: Analyzing trace with hash 328135410, now seen corresponding path program 10 times [2021-08-06 13:50:52,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:52,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100836380] [2021-08-06 13:50:52,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:52,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:53,219 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 13:50:53,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:53,219 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100836380] [2021-08-06 13:50:53,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100836380] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:53,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:53,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-06 13:50:53,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635787160] [2021-08-06 13:50:53,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-06 13:50:53,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:53,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-06 13:50:53,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-08-06 13:50:53,221 INFO L87 Difference]: Start difference. First operand 1445 states and 4153 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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 13:50:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:53,580 INFO L93 Difference]: Finished difference Result 2690 states and 7977 transitions. [2021-08-06 13:50:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 13:50:53,581 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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 84 [2021-08-06 13:50:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:53,584 INFO L225 Difference]: With dead ends: 2690 [2021-08-06 13:50:53,584 INFO L226 Difference]: Without dead ends: 1718 [2021-08-06 13:50:53,584 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 237.6ms TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-08-06 13:50:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2021-08-06 13:50:53,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1163. [2021-08-06 13:50:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1162 states have (on average 2.946643717728055) internal successors, (3424), 1162 states have internal predecessors, (3424), 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 13:50:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 3424 transitions. [2021-08-06 13:50:53,603 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 3424 transitions. Word has length 84 [2021-08-06 13:50:53,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:53,604 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 3424 transitions. [2021-08-06 13:50:53,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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 13:50:53,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 3424 transitions. [2021-08-06 13:50:53,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:53,605 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:53,605 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:53,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-06 13:50:53,606 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:50:53,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:53,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1154757292, now seen corresponding path program 11 times [2021-08-06 13:50:53,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:53,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998937951] [2021-08-06 13:50:53,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:53,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:50:54,159 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 13:50:54,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:50:54,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998937951] [2021-08-06 13:50:54,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998937951] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:50:54,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:50:54,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-06 13:50:54,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544417939] [2021-08-06 13:50:54,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-06 13:50:54,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:50:54,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-06 13:50:54,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2021-08-06 13:50:54,161 INFO L87 Difference]: Start difference. First operand 1163 states and 3424 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 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 13:50:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:50:54,636 INFO L93 Difference]: Finished difference Result 1733 states and 5139 transitions. [2021-08-06 13:50:54,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-06 13:50:54,637 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 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 84 [2021-08-06 13:50:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:50:54,640 INFO L225 Difference]: With dead ends: 1733 [2021-08-06 13:50:54,640 INFO L226 Difference]: Without dead ends: 923 [2021-08-06 13:50:54,640 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 373.7ms TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2021-08-06 13:50:54,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2021-08-06 13:50:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2021-08-06 13:50:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 922 states have (on average 2.811279826464208) internal successors, (2592), 922 states have internal predecessors, (2592), 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 13:50:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 2592 transitions. [2021-08-06 13:50:54,654 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 2592 transitions. Word has length 84 [2021-08-06 13:50:54,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:50:54,654 INFO L470 AbstractCegarLoop]: Abstraction has 923 states and 2592 transitions. [2021-08-06 13:50:54,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 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 13:50:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 2592 transitions. [2021-08-06 13:50:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-08-06 13:50:54,656 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:50:54,656 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:50:54,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-06 13:50:54,657 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-08-06 13:50:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:50:54,657 INFO L82 PathProgramCache]: Analyzing trace with hash 231321590, now seen corresponding path program 12 times [2021-08-06 13:50:54,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:50:54,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480727903] [2021-08-06 13:50:54,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:50:54,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:50:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 13:50:54,720 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-06 13:50:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-06 13:50:54,878 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-06 13:50:54,879 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-06 13:50:54,880 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 13:50:54,882 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-06 13:50:54,882 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-06 13:50:54,882 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-06 13:50:54,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-06 13:50:54,890 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2021-08-06 13:50:54,893 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-06 13:50:54,893 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-06 13:50:55,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 01:50:55 BasicIcfg [2021-08-06 13:50:55,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-06 13:50:55,043 INFO L168 Benchmark]: Toolchain (without parser) took 25109.85 ms. Allocated memory was 207.6 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 171.2 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. [2021-08-06 13:50:55,043 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 207.6 MB. Free memory is still 189.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-06 13:50:55,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.56 ms. Allocated memory is still 207.6 MB. Free memory was 171.0 MB in the beginning and 179.4 MB in the end (delta: -8.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 8.0 GB. [2021-08-06 13:50:55,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.33 ms. Allocated memory is still 207.6 MB. Free memory was 179.4 MB in the beginning and 176.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-06 13:50:55,043 INFO L168 Benchmark]: Boogie Preprocessor took 65.90 ms. Allocated memory is still 207.6 MB. Free memory was 176.2 MB in the beginning and 173.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-06 13:50:55,043 INFO L168 Benchmark]: RCFGBuilder took 3228.40 ms. Allocated memory was 207.6 MB in the beginning and 267.4 MB in the end (delta: 59.8 MB). Free memory was 173.1 MB in the beginning and 225.6 MB in the end (delta: -52.5 MB). Peak memory consumption was 145.6 MB. Max. memory is 8.0 GB. [2021-08-06 13:50:55,043 INFO L168 Benchmark]: TraceAbstraction took 21126.28 ms. Allocated memory was 267.4 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 225.1 MB in the beginning and 1.2 GB in the end (delta: -948.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. [2021-08-06 13:50:55,044 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.16 ms. Allocated memory is still 207.6 MB. Free memory is still 189.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 598.56 ms. Allocated memory is still 207.6 MB. Free memory was 171.0 MB in the beginning and 179.4 MB in the end (delta: -8.4 MB). Peak memory consumption was 20.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 84.33 ms. Allocated memory is still 207.6 MB. Free memory was 179.4 MB in the beginning and 176.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 65.90 ms. Allocated memory is still 207.6 MB. Free memory was 176.2 MB in the beginning and 173.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3228.40 ms. Allocated memory was 207.6 MB in the beginning and 267.4 MB in the end (delta: 59.8 MB). Free memory was 173.1 MB in the beginning and 225.6 MB in the end (delta: -52.5 MB). Peak memory consumption was 145.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21126.28 ms. Allocated memory was 267.4 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 225.1 MB in the beginning and 1.2 GB in the end (delta: -948.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L732] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L733] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L734] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L735] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L736] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L737] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L738] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t2327; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t2327, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2328; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t2328, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2329; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t2329, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 855]: 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: 859]: 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: 857]: 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, 136 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 20814.7ms, OverallIterations: 23, TraceHistogramMax: 1, EmptinessCheckTime: 258.3ms, AutomataDifference: 8723.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 340.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3192 SDtfs, 5171 SDslu, 16886 SDs, 0 SdLazy, 3034 SolverSat, 657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3466.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 4979.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11038occurred in iteration=0, InterpolantAutomatonStates: 270, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2819.2ms AutomataMinimizationTime, 22 MinimizatonAttempts, 7464 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 107.3ms SsaConstructionTime, 1489.3ms SatisfiabilityAnalysisTime, 6471.9ms InterpolantComputationTime, 1847 NumberOfCodeBlocks, 1847 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1741 ConstructedInterpolants, 0 QuantifiedInterpolants, 12493 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 13:50:55,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...